A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0-1 programming

Mathematics of Operations Research

Volumn 28, Issue 3, 2003, Pages 470-496

  Laurent, Monique ^a  

^a CWI   (Netherlands)

Author keywords

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

Indexed keywords

FUNCTIONS; INTEGER PROGRAMMING; LINEAR SYSTEMS; POLYNOMIALS; SET THEORY;

GOMORY-CHVATAL CUT; LASSERRE CONSTRUCTION;

LINEAR PROGRAMMING;

EID: 0141517272     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.28.3.470.16391     Document Type: Article

References (44)

1. Anjos, M. F., H. Wolkowicz. 2002. Strengthened semidefinite relaxations via a second lifting for the max-cut problem. Discrete Appl. Math. 119 79-106.
2. Balas, E., S. Ceria, G. Cornuéjols. 1993. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming 58 295-324.
3. Barahona, F., A. R. Mahjoub. 1986. On the cut polytope. Math. Programming 36 157-173.
4. Berg, C., J. P. R. Christensen, C. U. Jensen. 1979. A remark on the multidimensional moment problem. Math. Ann. 243 163-169.
5. ____, ____, P. Ressel. 1984. Harmonic Analysis and Semigroups - Theory of Positive Definite and Related Functions. Springer-Verlag, New York.
6. Chvátal, V. 1973. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4 305-337.
7. ____. W. Cook, M.Hartman. On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. 114/115 455-499.
8. Cook, W., S. Dash. 2001. On the matrix-cut rank of polyhedra. Math. Oper. Res. 26 19-30.
9. Cornuéjols, G., Y. Li. 2001. On the rank of mixed 0-1 polyhedra. K. Aardal, A. M. H. Gerards, eds. Integer Programming and Combinatorial Optimization 2001, Lecture Notes in Computer Science, No. 2081, 71-77.
10. Curto, R. E., L. A. Fialkow. 2000. The truncated complex K-moment problem. Trans. Amer. Math. Soc. 352 2825-2855.
11. de Klerk, E., D. V. Pasechnik. 2002. Approximating the stability number of a graph via copositive programming. SIAM J. Optim. 12 875-892.
12. Eisenbrand, F. 2000. On the membership problem for the elementary closure of a polyhedron. Combinatorica 19 299-300.
13. ____. A. S. Schulz. 1999. Bounds on the Chvátal rank of polytopes in the 0/1 cube. G. Cornuéjols, R. E. Burkard, G. J. Woeginger, eds. Integer Programming and Combinatorial Optimization 1999, Lecture Notes in Computer Science, No. 1610, 137-150.
14. Fuglede, B. 1983. The multidimensional moment problem. Expositiones Math. 1 47-65.
15. Fujie, T., M. Kojima. 1997. Semidefinite programming relaxation for nonconvex quadratic programs. J. Global Optim. 10 367-380.
16. Goemans, M. X., L. Tuncel. 2001. When does the positive semidefiniteness constraint help in lifting procedures. Math. Oper. Res. 26, 796-815.
17. ____, D. P. Williamson. 1995. Improved approximation algorithms for maximum cuts and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach. 42 1115-1145.
18. Grötschel, M., L. Lovász, A. Schrijver. 1988. Geometric Algorithms and Combinatorial Optimization. Springer Verlag, Berlin, New York.
19. Handelman, D. 1988. Representing polynomials by positive linear functions on compact convex polyhedra. Pacific J. Math. 132 35-62
20. Haviland, E. K. 1935. On the momentum problem for distributions in more than one dimension. I, II. Amer. J. Math. 57 562-568.
21. ____. 1936. On the momentum problem for distributions in more than one dimension. I, II. Amer. J. Math. 58 164-168.
22. Lasserre, J. B. 2000. Optimality conditions and LMI relaxations for 0-1 programs. Technical report no. 00099, CNRS-LAAS, Toulouse, France.
23. ____. 2001a. Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11 796-817.
24. ____. 2001b. An explicit exact SDP relaxation for nonlinear 0-1 programs. K. Aardal, A. M. H. Gerards, eds. Integer Programming and Combinatorial Optimization 2001, Lecture Notes in Computer Science, No. 2081, 293-303.
25. ____. 2002. Semidefinite programming vs. LP relaxations for polynomial programming. Math. Oper. Res. 27 347-360.
26. Laurent, M. 2001. Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure. SIAM J. Optim. 12 345-375.
27. ____. 2003. Semidefinite relaxations for max-cut. The Sharpest Cut: Festschrift in Honor of M. Padberg's 60th Birthday. SIAM, Philadelphia, PA, 291-327.
28. Lovász, L. 1979. On the Shannon capacity of a graph. IEEE Trans. Inform. Theory IT-25 1-7.
29. ____, A. Schrijver. 1991. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1 166-190.
30. Nesterov, Y. 2000. Squared functional systems and optimization problems. J. B. G. Frenk, C. Roos, T. Terlaky, S. Zhang, eds. High Performance Optimization. Kluwer Academic Publishers, Utrecht, The Netherlands, 405-440.
31. Parrilo, P. A. 2000. Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization. Ph.D. thesis, California Institute of Technology, Pasadena, CA.
32. Putinar, M. 1993. Positive polynomials on compact semialgebraic sets. Indiana Univ. Math. J. 42 969-984.
33. Reznick, B. 1998. Some concrete aspects of Hilbert's 17th problem. Report 98-002, Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, Champaign, IL.
34. Schmüdgen, K. 1991. The K-moment problem for compact semialgebraic sets. Math. Ann. 289 203-206.
35. Sherali, H. D., W. P. Adams. 1990. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3 411-430.
36. ____, ____. 1994. A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl. Math. 52 83-106.
37. ____, ____. 1999. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer, Boston, MA.
38. ____. ____, P. J. Driscoll. 1998. Exploiting special structures in constructing a hierarchy of relaxations for 0-1 mixed integer problems. Oper. Res. 46 396-405.
39. ____, C. H. Tuncbilek. 1992. A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique. J. Global Optim. 2 101-112.
40. ____, ____. 1997. Reformulation-linearization/convexification relaxations for univariate and multivariate polynomial programming problems. Oper. Res. Lett. 21 1-10.
41. Shor, N. Z. An approach to obtaining global extremums in polynomial mathematical programming problems. Kibernetika 5 102-106.
42. ____. 1998. Nondifferentiable Optimization and Polynomial Problems. Kluwer Academic Publishers, Boston, MA.
43. Stephen, T., L. Tunçel. 1999. On a representation of the matching polytope via semidefinite liftings. Math. Oper. Res. 24 1-7.
44. Wilf, H. S. 1968. Hadamard determinants, Möbius functions, and the chromatic number of a graph. Bull. Amer. Math. Soc. 74 960-964.