Easy and difficult objective functions for max cut

McCormick, S T and Rao, M R and Rinaldi, G (2003) Easy and difficult objective functions for max cut. Mathematical Programming, 94 (2). pp. 459-466.

Full text not available from this repository. (Request a copy)

Abstract

\enspaceThis 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 CreatorsORCiD
Rao, M RUNSPECIFIED
Item Type: Article
Additional Information: The research article was published by the author with the affiliation of Indian Institute of Management Bangalore.
Uncontrolled Keywords: Objective Function, Function Vector, Sign Pattern, Function Coefficient, Solvable Case
Subjects: Operations Management
Depositing User: Veeramani R
Date Deposited: 03 Apr 2019 13:45
Last Modified: 03 Apr 2019 13:45
URI: http://eprints.exchange.isb.edu/id/eprint/746
Publisher URL: https://doi.org/10.1007/s10107-002-0328-8
Publisher OA policy: http://sherpa.mimas.ac.uk/romeo/issn/0025-5610/
Related URLs:

Actions (login required)

View Item View Item
Statistics for DESI ePrint 746 Statistics for this ePrint Item