Skip to main content
Log in

Easy and difficult objective functions for max cut

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: November 29, 2000 / Accepted: August 17, 2001 Published online: December 9, 2002

RID="★"

ID="★" The research of this author was partially supported by an NSERC Research Grant.

Rights and permissions

Reprints and permissions

About this article

Cite this article

McCormick, S., Rao, M. & Rinaldi, G. Easy and difficult objective functions for max cut. Math. Program., Ser. B 94, 459–466 (2003). https://doi.org/10.1007/s10107-002-0328-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-002-0328-8

Keywords

Navigation