Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
Year of publication: |
2003
|
---|---|
Authors: | Laurent, Monique |
Published in: |
Mathematics of operations research. - Linthicum, Md : Inst, ISSN 0364-765X, ZDB-ID 1956838. - Vol. 28.2003, 4, p. 871-883
|
Saved in:
Saved in favorites
Similar items by person
-
Handelman’s hierarchy for the maximum stable set problem
Laurent, Monique, (2014)
-
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0-1 Programming
Laurent, Monique, (2003)
-
Some new classes of facets for the equicut polytope
DeSouza, C. C., (1991)
- More ...