A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming. Laurent, M. Mathematics of Operations Research, 28:470--496, 2003.
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming [link]Paper  doi  bibtex   
@article{laurent_comparison_2003,
	title = {A {Comparison} of the {Sherali}-{Adams}, {Lovász}-{Schrijver}, and {Lasserre} {Relaxations} for 0–1 {Programming}},
	volume = {28},
	issn = {0364-765X, 1526-5471},
	url = {http://pubsonline.informs.org/doi/abs/10.1287/moor.28.3.470.16391},
	doi = {10.1287/moor.28.3.470.16391},
	urldate = {2014-02-13TZ},
	journal = {Mathematics of Operations Research},
	author = {Laurent, M.},
	year = {2003},
	pages = {470--496}
}

Downloads: 0