Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra

Discrete Applied Mathematics

Volumn 156, Issue 1, 2008, Pages 25-41

  Hong, Sung Pil ^a   Tunçel, Levent ^b  

^a Seoul National University   (South Korea)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Integer programming; Lift and project; Semidefinite lifting; Semidefinite programming

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; ITERATIVE METHODS; PROBLEM SOLVING;

COMMUTATIVE MAPS; LOWER BOUND ANALYSES; SEMIDEFINITE LIFTINGS; SEMIDEFINITE PROGRAMMING;

COMBINATORIAL OPTIMIZATION;

EID: 35649006008     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2007.07.021     Document Type: Article

References (31)

1. Aguilera N.E., Bianchi S.M., and Nasini G.L. Lift and project relaxations for the matching and related polytopes. Discrete Appl. Math. 134 (2004) 193-212
2. S. Arora, B. Bollobás, L. Lovász, Proving integrality gaps without knowing the linear program, Proceedings of the 43rd IEEE Symposium FOCS, 2002, pp. 313-322.
3. E. Balas, Disjunctive programming: properties of the convex hull of feasible points. Management Science Research Report 348 GSIA, Carnegie Mellon University, Pittsburgh, PA, USA, 1974 (Appeared as: E. Balas. Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89 (1998) 3-44.)
4. Balas E., Ceria S., and Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming A 58 (1993) 295-323
5. Bienstock D., and Ozbay N. Tree-width and the Sherali-Adams operator. Discrete Optim. 1 (2004) 13-21
6. Bienstock D., and Zuckerberg M. Subset algebra lift operators for 0-1 integer programming. SIAM J. Optim. 15 (2004) 63-95
7. Chvátal V. Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4 (1973) 33-41
8. Chvátal V., Cook W., and Hartmann M. On cutting plane proofs in combinatorial optimization. Linear Algebra Appl. 114/115 (1989) 455-499
9. Cheung K.K.H. On Lovász-Schrijver lift-and-project procedures on the Dantzig-Fulkerson-Johnson relaxation of the TSP. SIAM J. Optim. 16 (2005) 380-399
10. Cook W., and Dash S. On the matrix-cut rank of polyhedra. Math. Oper. Res. 26 (2001) 19-30
11. Doob M. An interrelation between line graphs, eigenvalues and matroids. J. Combin. Theory B 15 (1973) 40-50
12. Eisenbrand F., and Schulz A.S. Bounds on the Chvátal rank of polytopes in the 0/1 cube. Combinatorica 23 (2003) 245-261
13. Feige U., and Krauthgamer R. The probable value of the Lovasz-Schrijver relaxations for maximum independent set. SIAM J. Comput. 32 (2003) 345-370
14. Gatermann K., and Parrilo P.A. Symmetry groups, semidefinite programs, and sums of squares. J. Pure Appl. Algebra 192 (2004) 95-128
15. Goemans M.X., and Rendl F. Semidefinite programs and association schemes. Computing 63 (1999) 331-340
16. Goemans M.X., and Tunçel L. When does the positive semidefiniteness constraint help in lifting procedures?. Math. Oper. Res. 26 (2001) 796-815
17. D. Grigoriev, E.A. Hirsch, D.V. Pasechnik, Complexity of semi-algebraic proofs, Electronic Colloquium on Computational Complexity, revision 3 of report no. 103, 2001.
18. Kojima M., and Tunçel L. Cones of matrices and successive convex relaxations of nonconvex sets. SIAM J. Optim. 10 (2000) 750-778
19. Lasserre J.B. An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Aardal K., and Gerards A.M.H. (Eds). Lecture Notes in Computer Science (2001) 293-303
20. Lasserre J.B. Polynomials nonnegative on a grid and discrete optimization. Trans. Amer. Math. Soc. 354 (2002) 631-649
21. Laurent M. Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure. SIAM J. Optim. 12 (2002) 345-375
22. Laurent M. Lower bound for the number of iterations in semidefinite hierarchies for the cut polytope. Math. Oper. Res. 28 (2003) 871-883
23. L. Lipták, Critical facets of the stable set polytope, Ph.D. Thesis, Yale University, 1999.
24. Lipták L., and Tunçel L. The stable set problem and the lift-and-project ranks of graphs. Math. Programming 98 (2003) 319-353
25. Lovász L. Semidefinite programs and combinatorial optimization. In: Reed B.A., and Sales C.L. (Eds). Recent Advances in Algorithms and Combinatorics. CMS Books Math., Ouvrages Math., SMC vol. 11 (2003), Springer, New York 137-194
26. Lovász L., and Schrijver A. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1 (1991) 166-190
27. Sherali H.D., and Adams W.P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3 (1990) 411-430
28. Sherali H.D., and Adams W.P. A reformulation-linearization technique for solving discrete and continuous nonconvex problems. Nonconvex Optim. Appl. 31 (1999)
29. Sherali H.D., and Lee Y. Tighter representations for set partitioning problems. Discrete Appl. Math. 68 (1996) 153-167
30. Stephen T., and Tunçel L. On a representation of the matching polytope via semidefinite liftings. Math. Oper. Res. 24 (1999) 1-7
31. Tutte W.T. Lectures on matroids. J. Res. Nat. Bur. Standards Sect. B 69 (1965) 1-47