A branch-and-price algorithm for the Steiner tree packing problem.
From MaRDI portal
Publication:5952785
DOI10.1016/S0305-0548(00)00066-6zbMATH Open1070.90134MaRDI QIDQ5952785FDOQ5952785
Authors: Guewoong Jeong, Kyungsik Lee, Sungsoo Park, Kyungchul Park 
Publication date: 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Reducibility among combinatorial problems
- Branch-and-price: Column generation for solving huge integer programs
- Title not available (Why is that?)
- Steiner problem in networks: A survey
- Steiner tree problems
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- Title not available (Why is that?)
- An Integer Programming Approach to the Bandwidth Packing Problem
- Min-cut clustering
- Packing Steiner trees: A cutting plane algorithm and computational results
- The steiner problem in graphs
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Packing Steiner trees: Polyhedral investigations
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
Uses Software
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)
