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

Tetsuya Fujie; Akihisa Tamura

doi:10.15807/jorsj.45.285

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

Tetsuya Fujie, Akihisa Tamura

Research output: Contribution to journal › Article › peer-review

4 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	285-292
Number of pages	8
Journal	Journal of the Operations Research Society of Japan
Volume	45
Issue number	3
DOIs	https://doi.org/10.15807/jorsj.45.285
Publication status	Published - 2002
Externally published	Yes

ASJC Scopus subject areas

Decision Sciences(all)
Management Science and Operations Research

Access to Document

10.15807/jorsj.45.285

Cite this

@article{63a0d6dbeb384f5098c4b57a1c48ef07,

title = "On gr{\"o}tschel-lov{\'a}sz-schrijver's relaxation of stable set polytopes",

abstract = "Gr{\"o}tschel, Lov{\'a}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.",

author = "Tetsuya Fujie and Akihisa Tamura",

year = "2002",

doi = "10.15807/jorsj.45.285",

language = "English",

volume = "45",

pages = "285--292",

journal = "Journal of the Operations Research Society of Japan",

issn = "0453-4514",

publisher = "Operations Research Society of Japan",

number = "3",

}

TY - JOUR

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

AU - Fujie, Tetsuya

AU - Tamura, Akihisa

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33645598192&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33645598192&partnerID=8YFLogxK

U2 - 10.15807/jorsj.45.285

DO - 10.15807/jorsj.45.285

M3 - Article

AN - SCOPUS:33645598192

VL - 45

SP - 285

EP - 292

JO - Journal of the Operations Research Society of Japan

JF - Journal of the Operations Research Society of Japan

SN - 0453-4514

IS - 3

ER -

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

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this