Packing Steiner trees: Polyhedral investigations
From MaRDI portal
Publication:1919089
DOI10.1007/BF02592085zbMath0853.90113MaRDI QIDQ1919089
Alexander Martin, Martin Grötschel, Robert Weismantel
Publication date: 1996
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Related Items
A branch-and-price algorithm for switch-box routing, The Steiner tree packing problem in VLSI design, Packing Steiner trees: A cutting plane algorithm and computational results, Optimum path packing on wheels: The consecutive case, Steiner tree packing revisited, Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs, A note on the generalized Steiner tree polytope, A branch-and-price algorithm for the Steiner tree packing problem., Packing the Steiner trees of a graph
Cites Work
- Packing Steiner trees: Further facets
- Packing Steiner trees: A cutting plane algorithm and computational results
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Routing in grid graphs by cutting planes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item