Skip to main content
Log in

Set packing relaxations of some integer programs

  • Published:
Mathematical Programming Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: September 1997 / Accepted: November 1999¶Published online June 8, 2000

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/PL00011381

Navigation