Mariana S. Escalante

Learn More
In this paper we relate antiblocker duality between polyhedra, graph theory and the disjunctive procedure. In particular, we analyze the behavior of the disjunctive procedure over the clique relaxation, K(G), of the stable set polytope in a graph G and the one associated to its complementary graph, K(Ḡ). We obtain a generalization of the Perfect Graph(More)
The behavior of the disjunctive operator, defined by Balas, Ceria and Cornuéjols, in the context of the “antiblocker duality diagram” associated with the stable set polytope,QSTAB(G), of a graph and its complement, was first studied byAguilera, Escalante and Nasini. The authors prove the commutativity of this diagram in any number of iterations of the(More)
We study the Lovász-Schrijver SDP-operator applied to the fractional stable set polytope of graphs. The problem of obtaining a combinatorial characterization of graphs for which the SDP-operator generates the stable set polytope in one step has been open since 1990. In an earlier publication, we named these graphs N+-perfect. In the current contribution, we(More)