Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure

SIAM Journal on Optimization

Volumn 12, Issue 2, 2002, Pages 345-375

  Laurent, Monique ^a  

^a CWI   (Netherlands)

Author keywords

Cut polytope; Lift and project; Linear relaxation; Semidefinite relaxation; Stable set polytope

Indexed keywords

EID: 0036013026     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623400379371     Document Type: Article

References (29)

1. Strengthened semidefinite relaxations via a second lifting for the max-cut problem
2. A lift-and-project cutting plane algorithm for mixed 0-1 programs
3. 5
4. On the computational complexity of Ising spin glass models
5. On cuts and matchings in planar graphs
6. On the cut polytope
7. On the matrix-cut rank of polyhedram
8. On Hamming geometry of unitary cubes
9. Geometry of cuts and metrics
10. When does the positive semidefiniteness constraint help in lifting procedures?
11. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
12. Geometric algorithms and combinatorial optimization
13. An explicit exact SDP relaxation for nonlinear 0 - 1 programs
14. Gap inequalities for the cut polytope
15. Connections between semidefinite relaxations of the max-cut and stable set problems
16. Semidefinite relaxations and lagrangian duality with application to combinatorial optimization
17. Cones of matrices and set-functions and 0-1 optimization
18. Nonpolyhedral relaxation of graph-bisection problems
19. A recipe for semidefinite relaxation for (0, 1)-quadratic programming
20. The Boolean quadric polytope: Some characteristics, facets and relatives
21. On certain metric spaces arising from Euclidean spaces by a change of metric and their imbedding in Hilbert spaces
22. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems
23. On a representation of the matching polytope via semidefinite liftings