A comparison of the Sherali-Adams, Lov\'asz-Schrijver and Lasserre relaxations for 0-1 programming.

2003

Mathematics of Operations Research , Volume 28 - Issue 3 p. 470- 496

Additional Metadata
Keywords	0/1 polytope, linear relaxation, semidefinite relaxation, lift-and-project, stable set polytope, cut polytope
MSC	Semidefinite programming (msc 90C22), Polyhedral combinatorics, branch-and-bound, branch-and-cut (msc 90C57)
THEME	Logistics (theme 3)
Publisher	INFORMS
Journal	Mathematics of Operations Research
Project	Semidefinite programming and combinatorial optimization
Organisation	Networks and Optimization
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	Laurent, M. (2003). A comparison of the Sherali-Adams, Lov\'asz-Schrijver and Lasserre relaxations for 0-1 programming. Mathematics of Operations Research, 28(3), 470–496.

Additional Files
11670B.pdf Author Manuscript , 310kb
Publisher Version

See Also
techReport A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming M. Laurent (Monique)
techReport A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming M. Laurent (Monique)
techReport A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming M. Laurent (Monique)

Publication