McCormick, S and Rao, M R and Rinaldi, G
(2012)
Easy with Difficulty Objective Functions for Max Cut.
Working Paper.
SSRN.
(Unpublished)
Full text not available from this repository.
(
Request a copy)
Abstract
This note investigates the boundary between polynomially-solvable Max Cut and NP Hard Max Cut instances when they are classified only on the basis of the sign pattern of the objective function coefficients, i.e., of the orthant containing the objective function vector. It turns out that the matching number of the subgraph induced by the positive edges is the key parameter that allows us to differentiate between polynomially-solvable and hard instances of the problem. We give some applications of the polynomially solvable cases.
| Affiliation: |
Indian School of Business
|
| ISB Creators: |
| ISB Creators | ORCiD |
|---|
| Rao, M R | UNSPECIFIED |
|
| Item Type: |
Monograph
(Working Paper)
|
| Additional Information: |
The research article was published by the author with the affiliation of Indian Institute of Management Bangalore. |
| Uncontrolled Keywords: |
Max Cut, Hard Max, polynomially-solvable |
| Subjects: |
Operations Management |
| Depositing User: |
Veeramani R
|
| Date Deposited: |
03 Apr 2019 16:13 |
| Last Modified: |
03 Apr 2019 16:13 |
| URI: |
http://eprints.exchange.isb.edu/id/eprint/759 |
| Publisher URL: |
http://dx.doi.org/10.2139/ssrn.2160674 |
| Related URLs: |
|
Actions (login required)
 |
View Item |
