TY - JOUR A1 - Grötschel, Martin A1 - Martin, Alexander A1 - Weismantel, Robert T1 - The Steiner tree packing problem in VLSI design JF - Mathematical Programming Y1 - 1997 VL - 78 IS - 2 SP - 265 EP - 281 ER - TY - CHAP A1 - Grötschel, Martin A1 - Martin, Alexander A1 - Weismantel, Robert ED - Rinaldi, Giovanni ED - Wolsey, Laurence T1 - Routing in grid graphs by cutting planes T2 - Integer Programming and Combinatorial Optimization. Proceedings of a Conference held at Centro Ettore Majorana, Erice, Italy, April 29 - May 1, 1993 Y1 - 1993 SP - 447 EP - 461 PB - Librarian CORE CY - Louvain-la-Neuve ER - TY - JOUR A1 - Borndörfer, Ralf A1 - Weismantel, Robert T1 - Set Packing Relaxations of Some Integer Programs JF - Math. Programming Y1 - 2000 UR - http://opus.kobv.de/zib/volltexte/1997/300/ VL - 88 SP - 425 EP - 450 ER - TY - JOUR A1 - Borndörfer, Ralf A1 - Weismantel, Robert T1 - Discrete Relaxations of Combinatorial Programs JF - Discrete Appl. Math. Y1 - 2001 UR - http://opus.kobv.de/zib/volltexte/1997/324/ VL - 112 IS - 1–3 SP - 11 EP - 26 ER - TY - JOUR A1 - Ferreira, Carlos A1 - Grötschel, Martin A1 - Martin, Alexander A1 - Weismantel, Robert A1 - Kiefl, Stefan A1 - Krispenz, Ludwig T1 - Some Integer Programs Arising in the Design of Main Frame Computers JF - ZOR - Methods and Models of Operations Research Y1 - 1993 VL - 38 IS - 1 SP - 77 EP - 100 ER - TY - JOUR A1 - Grötschel, Martin A1 - Martin, Alexander A1 - Weismantel, Robert T1 - Routing in Grid Graphs by Cutting Planes JF - ZOR - Mathematical Methods of Operations Research Y1 - 1995 VL - 41 IS - 3 SP - 255 EP - 275 ER - TY - JOUR A1 - Grötschel, Martin A1 - Martin, Alexander A1 - Weismantel, Robert T1 - Packing Steiner Trees: Separation Algorithms JF - SIAM Journal on Discrete Mathematics Y1 - 1996 U6 - https://doi.org/10.1137/S0895480193258716 VL - 9 IS - 2 SP - 233 EP - 257 ER - TY - JOUR A1 - Grötschel, Martin A1 - Martin, Alexander A1 - Weismantel, Robert T1 - Packing Steiner Trees: Further Facets JF - European Journal of Combinatorics Y1 - 1996 U6 - https://doi.org/10.1006/eujc.1996.0004 VL - 17 IS - 1 SP - 39 EP - 52 ER - TY - GEN A1 - Borndörfer, Ralf A1 - Weismantel, Robert T1 - Set Packing Relaxations of Some Integer Programs N2 - This paper is about {\em set packing relaxations\/} of combinatorial optimization problems associated with acyclic digraphs and linear orderings, cuts and multicuts, and vertex 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. T3 - ZIB-Report - SC-97-30 Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-2998 ER - TY - GEN A1 - Borndörfer, Ralf A1 - Weismantel, Robert T1 - Discrete Relaxations of Combinatorial Programs N2 - This paper investigates {\em relations\/} among combinatorial optimization problems. To establish such relations we introduce a transformation technique \mbox{---{\em aggregation}---} that allows to relax an integer program by means of another integer program. We prove that various families of prominent inequalities for the acyclic subdigraph problem, the multiple knapsack problem, the max cut, graph, and the clique partitioning problem, the set covering problem, and the set packing problem can be derived and separated in polynomial time in this way. Our technique is algorithmic. It has been implemented and used in a set partitioning code. T3 - ZIB-Report - SC-97-54 Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-3230 ER -