On grötschel-lovász-schrijver's relaxation of stable set polytopes

Tetsuya Fujie, Akihisa Tamura

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)285-292
Number of pages8
JournalJournal of the Operations Research Society of Japan
Issue number3
Publication statusPublished - 2002
Externally publishedYes

ASJC Scopus subject areas

  • General Decision Sciences
  • Management Science and Operations Research


Dive into the research topics of 'On grötschel-lovász-schrijver's relaxation of stable set polytopes'. Together they form a unique fingerprint.

Cite this