Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure

Additional Metadata
MSC	Polyhedral combinatorics, branch-and-bound, branch-and-cut (msc 90C57), Special polytopes (linear programming, centrally symmetric, etc.) (msc 52B12), Semidefinite programming (msc 90C22)
THEME	Logistics (theme 3)
Publisher	S.I.A.M.
Journal	SIAM Journal on Optimization
Note	Coden: sjope8
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. (2001). Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-and-project procedure. SIAM Journal on Optimization, (2), 345–375.

Additional Files
Publisher Version

Publication