Packing Steiner trees: Polyhedral investigations

Mathematical Programming, Series B

Volumn 72, Issue 2, 1996, Pages 101-123

  Grotschel M ^a   Martin, A ^a   Weismantel, R ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

Author keywords

Cutting planes; Facets; Packing; Polyhedron; Steiner tree

Indexed keywords

EID: 0000530859     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02592085     Document Type: Article

References (11)

1. M.R. Garey and D.S. Johnson, "The rectilinear Steiner tree problem is script N sign℘-complete," SIAM Journal on Applied Mathematics 32 (1977) 826-834.
2. M. Grötschel, A. Martin and R. Weismantel, "Routing in grid graphs by cutting planes," Zeitschrifl für Operations Research 41 (1995) 255-275.
3. M. Grötschel, A. Martin and R. Weismantel, "Packing Steiner trees: a cutting plane algorithm and computational results," Mathematical Programming 72 (1996) (this issue).
4. M. Grötschel, A. Martin and R. Weismantel, "Packing Steiner trees: further facets," European Journal on Combinatorics, to appear.
5. M. Grötschel and C.L. Monma, "Integer polyhedra associated with certain network design problems with connectivity constraints," SIAM Journal on Discrete Mathematics 3 (1990) 502-523.
6. R.M. Karp, "Reducibility among combinatorial problems," in: R.E. Miller and J.W. Thatcher, eds., Complexity of Computer Computations (Plenum, New York, 1972) pp. 85-103.
7. B. Korte, H.J. Prömel and A. Steger, "Steiner trees in VLSI-layout," in: B. Korte, L. Lovász, H.J. Prömel and A. Schrijver, eds., Paths, Flows, and VLSI-Layout (Springer, Berlin, 1990) pp. 185-214.
8. M.R. Kramer and J. van Leeuwen, "The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits," in: F.P. Preparata, ed., Advances in Computing Research, Vol. 2: VLSI Theory (Jai Press, London, 1984) pp. 129-146.
9. T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, (Wiley, Chichester, 1990).
10. A. Martin, "Packen von Steinerbäumen: Polyedrische Studien und Anwendung", Ph.D. Thesis, Technische Universität Berlin, (1992).
11. A. Schrijver, Theory of Linear and Integer Programming (Wiley, Chichester, 1986).