论文信息 - On the facets of the lift-and-project relaxations of graph subdivisions

On the facets of the lift-and-project relaxations of graph subdivisions

Abstract We study the behavior of lift-and-project procedures for solving combinatorial optimization problems as described by Lovasz and Schrijver (1991), in the context of the stable set problem on graphs. Following the work of Wolsey (1976), 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 subdivision of an edge and its generalization, the stretching of a vertex operation.

Néstor E. Aguilera | Mariana S. Escalante | Pablo G. Fekete

[1] L. A. Wolsey,et al. Further facet generating procedures for vertex packing polytopes , 1976, Math. Program..

[2] A. R. Mahjoub,et al. On the stable set polytope of a series-parallel graph , 1988, Math. Program..

[3] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[4] Levent Tunçel,et al. The stable set problem and the lift-and-project ranks of graphs , 2003, Math. Program..

[5] Levent Tunçel,et al. On the polyhedral lift-and-project methods and the fractional stable set polytope , 2009, Discret. Optim..

[6] Ali Ridha Mahjoub,et al. Compositions of Graphs and Polyhedra II: Stable Sets , 1994, SIAM J. Discret. Math..

[7] László Lovász,et al. Critical Facets of the Stable Set Polytope , 2001, Comb..