Lower bound for the number of iterations in semidefinite relaxations for the cut polytope.

2003-11-01

Mathematics of Operations Research , Volume 28 - Issue 4 p. 871- 883

Additional Metadata
Keywords	cut polytope, semidefinite programming
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). Lower bound for the number of iterations in semidefinite relaxations for the cut polytope. . Mathematics of Operations Research, 28(4), 871–883.

Additional Files
Fulltext Final Version
Publisher Version

Publication