Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4652611 | Electronic Notes in Discrete Mathematics | 2011 | 6 Pages |
Abstract
We study Lovász and Schrijverʼs hieararchy of relaxations based on positive semidefiniteness constraints derived from the fractional stable set polytope. We show that there are graphs G for which a single application of the underlying operator, N+, to the fractional stable set polytope gives a nonpolyhedral convex relaxation of the stable set polytope.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics