When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures
Levent Tuncel, Michel X. Goemans
Abstract
We study the lift-and-project procedures of Lovász and Schrijver for 0-1 integer programming problems. We prove that the procedure using the positive semidefiniteness constraint is not better than the one without it, in the worst case. Various examples are considered. We also provide geometric conditions characterizing when the positive semidefiniteness constraint does not help.
Create a lesson
Related papers
Sensitivity of Rotation Symmetric Boolean Functions via Binary Necklaces
Yuan Li, Jing Zhang
On the Stability of the Independence Number of the Distance Graph G(n,r,<s) for Growing r and s
Vsevolod A. Pokhachevskiy, Andrei Raigorodskii
On Intersection Hypergraph of Finite Non-Cyclic Abelian Groups
A N Ardra, S Ballal
The quarter-point theorem for Gromov hyperbolic graphs
Walter Carballosa, Jesus Mendez, Rosalio Reyes et al.
Finite noncommutative coinvariant algebras
Farid Aliniaeifard, Nantel Bergeron, Huilan Li et al.
Very high genus double Hurwitz numbers via mixing times
Baptiste Louf, Lucas Teyssier