10 citations · 35 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
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…
Optimal k-fold colorings of webs and antiwebs
Manoel Campêlo, Ricardo C. Corrêa, Phablo F. S. Moura +1
A k-fold x-coloring of a graph is an assignment of (at least) k distinct colors from the set {1, 2, ..., x} to each vertex such that any two adjacent vertices are assigned disjoint…
A Lagrangian Relaxation for the Maximum Stable Set Problem
Manoel Campelo, Ricardo C. Correa
We propose a new integer programming formulation for the problem of finding a maximum stable set of a graph based on representatives of stable sets. In addition, we investigate exa…