Block-diagonal semidefinite programming hierarchies for 0/1 programming
Optimization and Control
2009-01-02 v2
Abstract
Lovasz and Schrijver, and later Lasserre, proposed hierarchies of semidefinite programming relaxations for general 0/1 linear programming problems. In this paper these two constructions are revisited and two new, block-diagonal hierarchies are proposed. They have the advantage of being computationally less costly while being at least as strong as the Lovasz-Schrijver hierarchy. Our construction is applied to the stable set problem and experimental results for Paley graphs are reported.
Cite
@article{arxiv.0712.3079,
title = {Block-diagonal semidefinite programming hierarchies for 0/1 programming},
author = {N. Gvozdenovic and M. Laurent and F. Vallentin},
journal= {arXiv preprint arXiv:0712.3079},
year = {2009}
}
Comments
11 pages, (v2) revision based on suggestions by referee, computation of N+(TH(P_q)) included in Table 2