Date of Original Version

7-2009

Type

Article

Published In

Operations Research Letters Volume 37, Issue 6, November 2009, Pages 375-378

Abstract or Description

We consider the edge formulation of the stable set problem. We characterize its corner polyhedron, i.e. the convex hull of the points satisfying all the constraints except the non-negativity of the basic variables. We show that the non-trivial inequalities necessary to describe this polyhedron can be derived from one row of the simplex tableau as fractional Gomory cuts. It follows that the split closure is not stronger than the Chvátal closure for the edge relaxation of the stable set problem.

DOI

10.1016/j.orl.2009.06.006