A branch-and-price algorithm for the Steiner tree packing problem.

DOI10.1016/S0305-0548(00)00066-6zbMath1070.90134MaRDI QIDQ5952785

Guewoong Jeong, Kyungchul Park, Sungsoo Park, Kyungsik Lee

Publication date: 2002

Published in: Computers \& Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

Optimal multicast route packing ⋮ On routing in VLSI design and communication networks ⋮ Packing trees in communication networks

Uses Software

• BEAVER

Cites Work

• Unnamed Item
• Unnamed Item
• Min-cut clustering
• Packing Steiner trees: Polyhedral investigations
• Packing Steiner trees: A cutting plane algorithm and computational results
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Steiner problem in networks: A survey
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• An Integer Programming Approach to the Bandwidth Packing Problem
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• Reducibility among Combinatorial Problems
• The steiner problem in graphs
• Steiner tree problems

This page was built for publication: A branch-and-price algorithm for the Steiner tree packing problem.