抄録
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.
本文言語 | English |
---|---|
ページ(範囲) | 285-292 |
ページ数 | 8 |
ジャーナル | Journal of the Operations Research Society of Japan |
巻 | 45 |
号 | 3 |
DOI | |
出版ステータス | Published - 2002 |
外部発表 | はい |
ASJC Scopus subject areas
- 決定科学(全般)
- 経営科学およびオペレーションズ リサーチ