Computation of the Lasserre Ranks of Some Polytopes

References

• Balas E., Ceria S., Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0–1 programs. Math. Programming (1993) 58:295–324Crossref, Google Scholar
• Bienstock D., Zuckerberg M. Subset algebra lift operators for 0–1 integer programming. SIAM J. Optim. (2004) 15:63–95Crossref, Google Scholar
• Borchers B. CSDP, A C library for semidefinite programming. Optim. Methods Software (1999) 11:613–623Crossref, Google Scholar
• Chvátal V., Cook W., Hartman M. On cutting-plane proofs in combinatorial optimization. Linear Algebra Appl. (1989) 114/115:455–499Crossref, Google Scholar
• Cook W., Dash S. On the matrix-cut rank of polyhedra. Math. Oper. Res. (2001) 26:19–30Link, Google Scholar
• Cornuéjols G., Li Y., Aardal K., Gerards A. M. H. On the rank of mixed 0–1 polyhedra. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science (2001) 2081(Springer, Berlin, Germany) 71–77Crossref, Google Scholar
• Goemans M. X., Tunçel L. When does the positive semidefiniteness constraint help in lifting procedures? Math. Oper. Res. (2001) 26:796–815Link, Google Scholar
• Henrion D., Lasserre J. B. GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Software (2003) 29:165–194Crossref, Google Scholar
• Hong S. P., Tunçel L. Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra. (2004) . Research Report CORR 2004-05, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada. http://www.math.uwaterloo.ca/∼ltuncel/publications/corr2004-05.psGoogle Scholar
• Lasserre J. B., Aardal K., Gerards A. M. H. An explicit exact SDP relaxation for nonlinear 0–1 programs. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science (2001) 2081(Springer, Berlin, Germany) 293–303Crossref, Google Scholar
• Lasserre J. B. Global optimization with polynomials and the problem of moments. SIAM J. Optim. (2001) 11:796–817Crossref, Google Scholar
• Laurent M. A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0–1 programming. Math. Oper. Res. (2003) 28:470–496Link, Google Scholar
• Laurent M. Lower bound for the number of iterations in semidefinite relaxations for the cut polytope. Math. Oper. Res. (2003) 28:871–883Link, Google Scholar
• Strengthened semidefinite programming bounds for codesMath. ProgrammingForthcomingGoogle Scholar
• Lovász L., Schrijver A. Cones of matrices and set-functions and 0–1 optimization. SIAM J. Optim. (1991) 1:166–190Crossref, Google Scholar
• Sherali H. D., Adams W. P. A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. (1990) 3:411–430Crossref, Google Scholar
• Sturm J. F. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Software (1999) 11–12:625–653Crossref, Google Scholar