Grötschel, Lovász and Schrijver introduced a convex set containing the stable set polytope of a graph. They proved that the set is a polytope if and only if the corresponding graph is perfect. In this paper, we give an alternative proof of the fact based on a new representation of the convex set described by infinitely many convex quadratic inequalities.
|Number of pages||8|
|Journal||Journal of the Operations Research Society of Japan|
|Publication status||Published - 2002|
ASJC Scopus subject areas
- Decision Sciences(all)
- Management Science and Operations Research