activity
20122023
most citedSome advances on the set covering polyhedron of circulant matrices

2 citations · 3 across the 5 of their papers we have counts for

collaborators

8 papers

math.CO2023

Location-Domination Type Problems Under the Mycielski Construction

Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini +1

We consider the following variants of the classical minimum dominating set problem in graphs: locating-dominating set, locating total-dominating set and open locating-dominating se…

math.CO2019

Circuits and circulant minors

Silvia Bianchi, Graciela Nasini, Paola Tolomei +1

Circulant contraction minors play a key role for characterizing ideal circular matrices in terms of minimally non ideal structures. In this article we prove necessary and sufficien…

math.CO2017

On dominating set polyhedra of circular interval graphs

Silvia Bianchi, Graciela Nasini, Paola Tolomei +1

Clique-node and closed neighborhood matrices of circular interval graphs are circular matrices. The stable set polytope and the dominating set polytope on these graphs are therefor…

math.CO2016

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…

math.CO2015

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…

cs.DM2014

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…

math.CO2012★ 1 cited

The Minor inequalities in the description of the Set Covering Polyhedron of Circulant Matrices

Silvia M. Bianchi, Graciela L. Nasini, Paola B. Tolomei

In this work we give a complete description of the set covering polyhedron of circulant matrices with and by linear inequalities. In particular, we…

math.CO2012★ 2 cited

Some advances on the set covering polyhedron of circulant matrices

Silvia Bianchi, Graciela Nasini, Paola Tolomei

Working on the set covering polyhedron of consecutive ones circulant matrices, Argiroffo and Bianchi found a class of facet defining inequalities, induced by a particular family of…