2 papers
math.CO2022
On the arboreal jump number of a poset
Evellyn S. Cavalcante, Sebastián Urrutia, Vinicius F. dos Santos
A jump is a pair of consecutive elements in an extension of a poset which are incomparable in the original poset. The arboreal jump number is an NP-hard problem that aims to find a…
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.…