10 citations · 22 across the 7 of their papers we have counts for
Showing cs.DMShow all
3 papers · 1 filter
cs.DM2021
Valid inequalities and a branch-and-cut algorithm for the routing and spectrum allocation problem
Marcelo Bianchetti, Javier Marenco
One of the most promising solutions to deal with huge data traffic demands in large communication networks is given by flexible optical networking, in particular the flexible grid…
cs.DM2017
On the combinatorics of the 2-class classification problem
Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco
A set of points is linearly separable if the convex hulls of and are disjoint, hence there exists a hyperplane separating $X_B…
cs.DM2015★ 10 cited
General Cut-Generating Procedures for the Stable Set Polytope
Ricardo C. Corrêa, Diego Delle Donne, Ivo Koch +1
We propose general separation procedures for generating cuts for the stable set polytope, inspired by a procedure by Rossi and Smriglio and applying a lifting method by Xavier and…