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.…