Artículos de revistas
Lift-and-project ranks of the stable set polytope of joined a-perfect graphs
Bianchi, S; Escalante, Mariana Silvina; Montelar, María Susana; Lift-and-project ranks of the stable set polytope of joined a-perfect graphs; Elsevier Science; Discrete Applied Mathematics; 210; 9-2016; 176-184
Escalante, Mariana Silvina
Montelar, María Susana
In this paper we study lift-and-project polyhedral operators defined by Lovász and Schrijver and Balas, Ceria and Cornuéjols on the clique relaxation of the stable set polytope of webs. We compute the disjunctive rank of all webs and consequently of antiwebs. We also obtain the disjunctive rank of the antiweb constraints for which the complexity of the separation problem is still unknown. Finally, we use our results to provide bounds of the disjunctive rank of larger classes of graphs as joined a-perfect graphs, where near-bipartite graphs belong to.