activity
20132023
most citedA branch and cut algorithm for minimum spanning trees under conflict constraints

42 citations · 59 across the 6 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.DS2016

The matching relaxation for a class of generalized set partitioning problems

Phillippe Samer, Evellyn Cavalcante, Sebastián Urrutia +1

This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints.…