Packing Steiner trees: A cutting plane algorithm and computational results
From MaRDI portal
Publication:1919090
DOI10.1007/BF02592086zbMath0853.90114OpenAlexW2082591111MaRDI QIDQ1919090
Alexander Martin, Robert Weismantel, Martin Grötschel
Publication date: 6 January 1997
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02592086
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, Graphs with large generalized (edge-)connectivity, The Steiner tree packing problem in VLSI design, Packing Steiner trees: Polyhedral investigations, Optimum path packing on wheels: The consecutive case, A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs, Steiner tree packing revisited, On two generalized connectivities of graphs, Approximation algorithms and hardness results for packing element-disjoint Steiner trees in planar graphs, Automated knowledge source selection and service composition, The minimum size of a graph with given tree connectivity, Constructing edge-disjoint Steiner paths in lexicographic product networks, On routing in VLSI design and communication networks, A solution to a conjecture on the generalized connectivity of graphs, A branch-and-price algorithm for the Steiner tree packing problem., Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks, Mathematical methods for physical layout of printed circuit boards: an overview, Path-connectivity of lexicographic product graphs, Packing trees in communication networks, Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solution of large-scale symmetric travelling salesman problems
- Partitioning procedures for solving mixed-variables programming problems
- Packing Steiner trees: Polyhedral investigations
- Decomposition Principle for Linear Programs
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Routing in grid graphs by cutting planes
- Packing Steiner Trees: Separation Algorithms
- The steiner problem in graphs
