A comparison of the Sherali-Adams, Lov\'asz-Schrijver and Lasserre relaxations for 0-1 programming.
Mathematics of Operations Research , Volume 28 - Issue 3 p. 470- 496
|0/1 polytope, linear relaxation, semidefinite relaxation, lift-and-project, stable set polytope, cut polytope|
|Semidefinite programming (msc 90C22), Polyhedral combinatorics, branch-and-bound, branch-and-cut (msc 90C57)|
|Logistics (theme 3)|
|Mathematics of Operations Research|
|Semidefinite programming and combinatorial optimization|
|Organisation||Networks and Optimization|
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.