On the facets of lift-and-project relaxations under graph operations

We study the behavior of lift-and-project procedures for solving combinatorial optimization problems as described by Lovász and Schrijver (1991) [6] in the context of the stable set problem on graphs. Following the work of Wolsey (1976) [10], Lipták and Lovász (2001) [4] and Lipták and Tunçel (2003) [5], we investigate how to generate facets of the relaxations obtained by these procedures from facets of the relaxations of the original graph, after applying fundamental graph operations. We show our findings for the odd and the star subdivision, the stretching of a node and a new operation defined herein called the clique subdivision of an edgeFil: Aguilera, Néstor Edgardo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional del Litoral; ArgentinaFil: Escalante, Mariana Silvina. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario; ArgentinaFil: Fekete, Pablo Gabriel. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario; Argentin