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

Computers and Operations Research

Volumn 29, Issue 3, 2002, Pages 221-241

  Jeong, Gue woong ^a   Lee, Kyungsik ^b   Park, Sungsoo ^a   Park, Kyungchul ^c  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Electronics and Telecommunications Research Institute (ETRI)   (South Korea)

^c KT Cooperation   (South Korea)

Author keywords

Branch and price; Column generation; Steiner tree packing problem (STP); VLSI design

Indexed keywords

ALGORITHMS; ELECTRONIC EQUIPMENT; INTEGER PROGRAMMING; TREES (MATHEMATICS); VLSI CIRCUITS;

TREE PACKING PROBLEM;

OPERATIONS RESEARCH;

ALGORITHM;

EID: 0036489510     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(00)00066-6     Document Type: Article

References (23)

1. Packing Steiner trees: A cutting plane algorithm and computational results
2. VLSI routing: Four layers suffice
3. On the structure of three-layer wireable layouts
4. Channel routing
5. The rectilinear steiner tree problem is NP-complete
6. Reducibility among combinatorial problems
7. The complexity of wire-routing and finding minimum area layouts for arbitrary VLSI circuits
8. Channel-routing problem in the knock-knee mode is NP-complete
9. Packing steiner trees: Polyhedral investigations
10. The Steiner problem in graphs
11. Branch-and-price: Column generation for solving huge integer programs
12. Min-cut clustering
13. A branch-and-price algorithm for the generalized assignment problem
14. An integer programming approach to the bandwidth packing problem
15. Hierarchical wire routing
16. BEAVER: A computational-geometry-based tool for switchbox routing
17. A greedy switchbox router
18. Steiner tree problems
19. The Steiner problem in networks: A survey
20. Send-and-split method for minimum-concave-cost network flows