6 papers
Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
Mauro Lucci, Diego Delle Donne, Mariana Escalante
The optimal placement of measurement devices in electrical power systems is commonly modeled through the power dominating set problem. However, in real-world applications, these de…
Packing functions and graphs with perfect closed neighbourhood matrices
Mariana Escalante, Erica Hinrichsen, Valeria. Leoni
In this work we consider a straightforward linear programming formulation of the recently introduced -packing function problem in graphs, for each fixed value of the positiv…
Lovász-Schrijver PSD-operator on Claw-Free Graphs
Silvia Bianchi, Mariana Escalante, Graciela Nasini +1
The subject of this work is the study of $\LS_+$-perfect graphs defined as those graphs for which the stable set polytope $\stab(G)$ is achieved in one iteration of Lovász-Schr…
Characterizing N+-perfect line graphs
M. Escalante, G. Nasini, A. Wagler
The subject of this contribution is the study of the Lovász-Schrijver PSD-operator N+ applied to the edge relaxation of the stable set polytope of a graph. We are particularly inte…
Lift-and-project ranks of the stable set polytope of joined a-perfect graphs
S. Bianchi, M. Escalante, M. S. Montelar
In this paper we study lift-and-project polyhedral operators defined by Lov?asz and Schrijver and Balas, Ceria and Cornu?ejols on the clique relaxation of the stable set polytope o…
Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
S. Bianchi, M. Escalante, G. Nasini +1
We study the Lovász-Schrijver lift-and-project operator () based on the cone of symmetric, positive semidefinite matrices, applied to the fractional stable set polytope of gr…