Connections between semidefinite relaxations of the max-cut and stable set problems

Mathematical Programming, Series B

Volumn 77, Issue 1, 1997, Pages 225-246

  Laurent, Monique ^a   Poljak, Svatopluk ^b   Rendl, Franz ^c  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b UNIVERSITY OF PASSAU   (Germany)

^c GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Max cut problem; Semidefinite relaxations; Stable set problem

Indexed keywords

COMBINATORIAL MATHEMATICS; FUNCTIONS; GEOMETRY; PROBLEM SOLVING;

LOVASZ'S THETA FUNCTION; MAX CUT PROBLEM; SEMIDEFINITE RELAXATIONS; STABLE SET PROBLEM;

OPTIMIZATION;

EID: 0031144411     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. E. Balas, S. Ceria and G. Cornuejols, A lift-and-project cutting plane algorithm for mixed 0-1 programs, Mathematical Programming 58 (1993) 295-324.
2. E. Balas, S. Ceria, G. Cornuejols and G. Pataki, Polyhedral methods for the maximum clique problem, Technical Report, Carnegie Mellon University, Pittsburgh, PA, 1994.
3. E. Balas, S. Ceria, G. Cornuejols and G. Pataki, Updated semi-definite constraints, Technical Report, Carnegie Mellon University, Pittsburgh, PA, 1994.
4. F. Barahona, On cuts and matchings in planar graphs, Mathematical Programming 60 (1993) 53-68.
5. F. Barahona and A.R. Mahjoub, On the cut polytope, Mathematical Programming 36 (1986) 157-173.
6. W.W. Barrett, C.R. Johnson and R. Loewy, The real positive definite completion problem: Cycle completability, Memoirs of the AMS 584 (1996).
7. C. Delorme and S. Poljak, Laplacian eigenvalues and the max-cut problem, Mathematical Programming 63 (1993) 557-574.
8. C. De Simone, The cut polytope and the boolean quadric polytope, Discrete Mathematics 79 (1989/1990) 71-75.
9. U. Feige and M.X. Goemans, Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT, in: Proceedings of the Israel Symposium on Theory of Computing and Systems, 1995, 182-189.
10. A.M.H. Gerards and F.B. Shepherd, The characterization of graphs with all subgraphs t-perfect, Research Report LSE-CDAM-96-09, Centre for Discrete and Applicable Mathematics, London School of Economics and Political Science, June 1996.
11. M.X. Goemans and D.P. Williamson, .878-approximation algorithms for MAX CUT and MAX 2SAT, in: Proceedings of the 26th Annual Symposium on Theory of Computing, Montréal (1994) 422-431.
12. R. Grone, C.R. Johnson, E.M. Sá and H. Wolkowicz, Positive definite completions of partial hermitian matrices, Linear Algebra and its Applications 58 (1984) 109-124.
13. M. Grötschel, L. Lovász and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
14. P.L. Hammer, Some network flow problems solved with pseudo-boolean programming, Operations Research 13 (1965) 388-399.
15. P.L. Hammer, P. Hansen and B. Simeone, Roof duality, complementation and persistency in quadratic 0-1 optimization, Mathematical Programming 28 (1984) 121-155.
16. C. Helmberg, F. Rendl, R.J. Vanderbei and H. Wolkowicz, A primal-dual interior point method for the max-min eigenvalue problem, SIAM Journal on Optimization 6 (1996) 342-361.
17. J. Kleinberg and M. Goemans, The Lovász theta function and a semidefinite programming relaxation of vertex cover, SIAM Journal on Discrete Mathematics, to appear.
18. M. Laurent, The real positive semidefinite completion problem for series-parallel graphs, Linear Algebra and its Applications 252 (1997) 347-366.
19. M. Laurent and S. Poljak, On a positive semidefinite relaxation of the cut polytope, Linear Algebra and its Applications 223/224 (1995) 439-461.
20. M. Laurent and S. Poljak, On the facial structure of the set of correlation matrices, SIAM Journal on Matrix Analysis and Applications 17 (1996) 530-547.
21. L. Lovász and A. Schrijver, Cones of matrices and set-functions and 0-1 optimization, SIAM Journal of Optimization 1 (2) (1991) 166-190.
22. M. Padberg, The boolean quadric polytope: Some characteristics, facets and relatives, Mathematical Programming 45 (1989) 139-172.
23. S. Poljak and F. Rendl, Nonpolyhedral relaxation of graph-bisection problems, SIAM Journal on Optimization 5 (1995) 467-487.
24. S. Poljak and Zs. Tuza, On the expected relative error of the polyhedral approximation of the max-cut, Operations Research Letters 16 (1994) 191-198.
25. A. Schrijver, A comparison of the Delsarte and Lovász bound, IEEE Transactions on Information Theory 25 (1979) 425-429.