2 citations · 2 across the 2 of their papers we have counts for
4 papers
The Minimum Clique Routing Problem on Cycles
Mariana Escalante, Martín Matamala, Iván Rapaport +2
In the Minimum Clique Routing Problem on Cycles \textsc{MCRPC} we are given a cycle together with a set of demands (weighted origin-destination pairs) and the goal is to route all…
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…
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…
Addendum to Vertex adjacencies in the set covering polyhedron
Néstor E. Aguilera, Ricardo D. Katz, Paola B. Tolomei
We study the relationship between the vertices of an up-monotone polyhedron and those of the polytope obtained by truncating with the unit hypercube. When has binar…