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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: September 1997 / Accepted: November 1999¶Published online June 8, 2000
Rights and permissions
About this article
Cite this article
Borndörfer, R., Weismantel, R. Set packing relaxations of some integer programs. Math. Program. 88, 425–450 (2000). https://doi.org/10.1007/PL00011381
Issue Date:
DOI: https://doi.org/10.1007/PL00011381