A branch-and-price algorithm for the Steiner tree packing problem.
From MaRDI portal
Publication:5952785
Recommendations
Cites work
- scientific article; zbMATH DE number 4039253 (Why is no real title available?)
- scientific article; zbMATH DE number 49142 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- An Integer Programming Approach to the Bandwidth Packing Problem
- Branch-and-price: Column generation for solving huge integer programs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Min-cut clustering
- Packing Steiner trees: A cutting plane algorithm and computational results
- Packing Steiner trees: Polyhedral investigations
- Reducibility among combinatorial problems
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Steiner problem in networks: A survey
- Steiner tree problems
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The steiner problem in graphs
Cited in
(7)- A branch-and-price algorithm for switch-box routing
- Steiner tree packing revisited
- A RELAX-AND-CUT ALGORITHM FOR THE KNAPSACK NODE WEIGHTED STEINER TREE PROBLEM
- Optimal multicast route packing
- Vertex-disjoint packing of two Steiner trees: polyhedra and branch-and-cut
- On routing in VLSI design and communication networks
- Packing trees in communication networks
This page was built for publication: A branch-and-price algorithm for the Steiner tree packing problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952785)