When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures
Combinatorics
2007-05-23 v1 Operator Algebras
Abstract
We study the lift-and-project procedures of Lov\'asz 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.
Cite
@article{arxiv.math/0006036,
title = {When Does the Positive Semidefiniteness Constraint Help In Lifting Procedures},
author = {Levent Tuncel and Michel X. Goemans},
journal= {arXiv preprint arXiv:math/0006036},
year = {2007}
}
Comments
24 pages, 3 images