ON GROTSCHEL-LOVASZ-SCHRIJVER'S RELAXATION OF STABLE SET POLYTOPES

Tetsuya Fujie, Akihisa Tamura
2002 Journal of the Operations Research Society of Japan  
Grotschel, Lovhz 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.
doi:10.15807/jorsj.45.285 fatcat:mtrwcsg6vrgkfn65gxnced3s5q