Key words: set packing – polyhedral combinatorics – cutting planes – integer programming
Mathematics Subject Classification (2000): 90C10
Springer Online Journal Archives 1860-2000
Abstract. This paper is about set packing relaxations of combinatorial optimization problems associated with acyclic digraphs and linear orderings, cuts and multicuts, and set packings themselves. Families of inequalities that are valid for such a relaxation as well as the associated separation routines carry over to the problems under investigation.
Type of Medium: