Mathematical Programming

, Volume 88, Issue 3, pp 425–450 | Cite as

Set packing relaxations of some integer programs

  • Ralf Borndörfer
  • Robert Weismantel


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.

Key words: set packing – polyhedral combinatorics – cutting planes – integer programming 
Mathematics Subject Classification (2000): 90C10 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Ralf Borndörfer
    • 1
  • Robert Weismantel
    • 2
  1. 1.Konrad-Zuse-Zentrum Berlin, Takustr. 7, 14195 Berlin, GermanyDE
  2. 2.Otto-von-Guericke Univ. Magdeburg, Universitätsplatz 2, 39106 Magdeburg, GermanyDE

Personalised recommendations