42 citations · 59 across the 6 of their papers we have counts for
Showing cs.DSShow all
2 papers · 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.…
cs.DS2013★ 42 cited
A branch and cut algorithm for minimum spanning trees under conflict constraints
Phillippe Samer, Sebastián Urrutia
We study approaches for the exact solution of the \NP--hard minimum spanning tree problem under conflict constraints. Given a graph and a set of con…