Set packing relaxations of some integer programs |
| |
| Authors: | Ralf Borndörfer Robert Weismantel |
| |
| Institution: | 1.Konrad-Zuse-Zentrum Berlin, Takustr. 7, 14195 Berlin, Germany,DE;2.Otto-von-Guericke Univ. Magdeburg, Universit?tsplatz 2, 39106 Magdeburg, Germany,DE |
| |
| 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.
Received: September 1997 / Accepted: November 1999?Published online June 8, 2000 |
| |
| Keywords: | : set packing – polyhedral combinatorics – cutting planes – integer programming |
| 本文献已被 SpringerLink 等数据库收录！ |
|
