caa a22 4500 475769635 CHVBK 20180406123616.0 cr unu---uuuuu 170329e20000901xx s 000 0 eng 10.1007/PL00011381 doi (NATIONALLICENCE)springer-10.1007/PL00011381 Set packing relaxations of some integer programs [Elektronische Daten] [Ralf Borndörfer, Robert Weismantel] 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. Springer-Verlag Berlin Heidelberg, 2000 Key words: set packing - polyhedral combinatorics - cutting planes - integer programming nationallicence Mathematics Subject Classification (2000): 90C10 nationallicence Borndörfer Ralf Konrad-Zuse-Zentrum Berlin, Takustr. 7, 14195 Berlin, Germany, DE aut Weismantel Robert Otto-von-Guericke Univ. Magdeburg, Universitätsplatz 2, 39106 Magdeburg, Germany, DE aut https://doi.org/10.1007/PL00011381 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/PL00011381 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Borndörfer Ralf Konrad-Zuse-Zentrum Berlin, Takustr. 7, 14195 Berlin, Germany, DE aut NATIONALLICENCE 700 1- Weismantel Robert Otto-von-Guericke Univ. Magdeburg, Universitätsplatz 2, 39106 Magdeburg, Germany, DE aut Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer