Mathematical Programming

, Volume 36, Issue 2, pp 157–173 | Cite as

On the cut polytope

  • Francisco Barahona
  • Ali Ridha Mahjoub


The cut polytopeP C (G) of a graphG=(V, E) is the convex hull of the incidence vectors of all edge sets of cuts ofG. We show some classes of facet-defining inequalities ofP C (G). We describe three methods with which new facet-defining inequalities ofP C (G) can be constructed from known ones. In particular, we show that inequalities associated with chordless cycles define facets of this polytope; moreover, for these inequalities a polynomial algorithm to solve the separation problem is presented. We characterize the facet defining inequalities ofP C (G) ifG is not contractible toK 5. We give a simple characterization of adjacency inP C (G) and prove that for complete graphs this polytope has diameter one and thatP C (G) has the Hirsch property. A relationship betweenP C (G) and the convex hull of incidence vectors of balancing edge sets of a signed graph is studied.

Key words

Max cut problem facets of polyhedra polyhedral combinatorics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    F. Barahona, “On the computational complexity of Ising spin glass models,”Journal of Physics A Mathematics and General 15 (1982) 3241–3250.CrossRefMathSciNetGoogle Scholar
  2. [2]
    F. Barahona, “The max cut problem in graphs not contractible toK 5,”Operations Research Letters 2 (1983) 107–111.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    F. Barahona, M. Grötschel and A.R. Mahjoub, “Facets of the bipartite subgraph polytope,”Mathematics of Operations Research 10 (1985) 340–358.zbMATHMathSciNetCrossRefGoogle Scholar
  4. [4]
    M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).zbMATHGoogle Scholar
  5. [5]
    M. Grötschel, L. Lovász and A. Schrijver, “The ellipsoid method and its consequences in combinatorial optimization,”Combinatorica 1 (1981) 169–197.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    M. Grötschel and G.L. Nemhauser, “A polynomial algorithm for the max-cut problem on graphs without long odd cycles”,Math. Programming 29 (1984) 28–40.zbMATHMathSciNetGoogle Scholar
  7. [7]
    F.O. Hadlock, “Finding a maximum cut of planar graph in polynomial time”,SIAM Journal on Computing 4 (1975) 221–225.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    F. Harary, “On the notion of balance of a signed graph,”The Michigan Mathematic Journal 2 (1953) 143–146.CrossRefGoogle Scholar
  9. [9]
    P.D. Seymour, “Matroids and multicommodity flows,”European Journal of Combinatorics 2 (1981) 257–290.zbMATHMathSciNetGoogle Scholar

Copyright information

© The Mathematical Programming Society, Inc. 1986

Authors and Affiliations

  • Francisco Barahona
    • 1
  • Ali Ridha Mahjoub
    • 2
  1. 1.Department of Combinatorics and OptimizationUniversity of WaterlooWaterlooCanada
  2. 2.Laboratoire ARTEMIS, Institut IMAGUniversité Scientifique et Medicale de GrenobleFrance

Personalised recommendations