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

Authors:
Gue-woong Jeong;Kyungsik Lee;Sungsoo Park;Kyungchul Park
Affiliations:
Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, 373-1 Gusong-dong, Yusong-gu, Taejon, South Korea;Electronics and Telecommunications Research Institute, 161 Kajong-dong, Yusong-gu, Taejon, South Korea;Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, 373-1 Gusong-dong, Yusong-gu, Taejon, South Korea;Telecommunication Network Lab., Korea Telecom, 463-1 Junmin-dong, Yusong-gu, Taejon, South Korea
Venue:
Computers and Operations Research
Year:
2002

Citing 10
Cited 1

Send-and-split method for minimum-concave-cost network flows

Mathematics of Operations Research
Steiner problem in networks: a survey

Networks
Integer and combinatorial optimization

Integer and combinatorial optimization
Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
Min-cut clustering

Mathematical Programming: Series A and B
Packing Steiner trees: polyhedral investigations

Mathematical Programming: Series A and B
Packing Steiner trees: a cutting plane algorithm and computational results

Mathematical Programming: Series A and B
An integer programming approach to the bandwidth packing problem

Management Science
VISI Physical Design Automation: Theory and Practice

VISI Physical Design Automation: Theory and Practice
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research

On routing in VLSI design and communication networks

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper deals with the Steiner tree packing problem. For a given undirected graph G = (V, E) with positive integer capacities and non-negative weights on its edges, and a list of node sets (nets), the problem is to find a connection of nets which satisfies the edge capacity limits and minimizes the total weights. We focus on the switchbox routing problem in knock-knee model and formulate this problem as an integer programming using Steiner tree variables. We develop a branch-and-price algorithm. The algorithm is applied on some standard test instances and we compare the performances with the results using cutting-plane approach. Computational results show that our algorithm is competitive to the cutting plane algorithm presented by Grötschel et al. and can be used to solve practically sized problems.