Mathematical Programming

, Volume 56, Issue 1, pp 121-160

Facets for the cut cone I

  • Michel DezaAffiliated withCNRS, Université Paris VII
  • , Monique LaurentAffiliated withCNRS, LAMSADE, Université Paris Dauphine

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


We study facets of the cut coneC n , i.e., the cone of dimension 1/2n(n − 1) generated by the cuts of the complete graph onn vertices. Actually, the study of the facets of the cut cone is equivalent in some sense to the study of the facets of the cut polytope. We present several operations on facets and, in particular, a “lifting” procedure for constructing facets ofC n+1 from given facets of the lower dimensional coneC n . After reviewing hypermetric valid inequalities, we describe the new class of cycle inequalities and prove the facet property for several subclasses. The new class of parachute facets is developed and other known facets and valid inequalities are presented.

Key words

Max-cut problem cone polytope facet lifting hypermetric inequality