Block-diagonal semidenfinite programming hierarchies for 0/1 programming

N. Gvozdenovic, M. Laurent, F. Vallentin

Research output: Contribution to journalArticleScientificpeer-review

9 Citations (Scopus)
367 Downloads (Pure)


Lovász and Schrijver, and later Lasserre, proposed hierachies of semidefinite programming relaxation 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 Lovász-Schrijver hierarchy. Our construction is applied to the stable set problem and experimental results of Paley graphs are reported.
Original languageEnglish
Pages (from-to)27-31
JournalOperations Research Letters
Issue number1
Publication statusPublished - 2009


Dive into the research topics of 'Block-diagonal semidenfinite programming hierarchies for 0/1 programming'. Together they form a unique fingerprint.

Cite this