When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?

References

• Balas E. Disjunctive programming: Properties of the convex hull of feasible points. (1974) . Management Science Research Report 348 GSIA, Carnegie Mellon University, Pittsburgh, PAGoogle Scholar
• Balas E., Ceria S., Cornuéjols G. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming (1993) 58:295–323Crossref, Google Scholar
• Cook W., Dash S. On the matrix-cut rank of polyhedra. Math. Oper. Res. (2001) 26:19–30Link, Google Scholar
• Doignon J.-P. Convexity in crystallographical lattices. J. Geometry (1973) 3:71–85Crossref, Google Scholar
• Edmonds J. Maximum matching and a polyhedron with 0,1-vertices. J. Res. National Bureau of Standards-B (1965) 69B:125–130Crossref, Google Scholar
• Grötschel M., Lovász L., Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica (1981) 1(2):169–197Crossref, Google 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
• Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Stephen T., Tunçel L. On a representation of the matching polytope via semidefinite liftings. Math. Oper. Res. (1999) 24:1–7Link, Google Scholar