Journal of the Korean Operations Research and Management Science Society (한국경영과학회지)

The Korean Operations Research and Management Science Society (한국경영과학회)
권호 표지

Column Generation Approach to the Steiner Tree Packing Problem

열 생성 기법을 이용한 스타이너 나무 분할 문제에 관한 연구

  • 정규웅 (한국과학기술원 산업공학과) ;
  • 이경식 (한국전자통신연구원) ;
  • 박성수 (한국과학기술원 산업공학과) ;
  • 박경철 (한국통신 통신망연구소)
  • Published : 2000.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

We consider 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. The model contains exponential number of variables, but the problem can be solved using a polynomial time column generation procedure. We test the algorithm on some standard test instances and 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 Grotschel et al. and can be used to solve practically sized problems.

Keywords

References

  1. Operations Research v.46 Branch-and-price : Column generation for solving huge integer programs Barnhart, C.;E. L. Johnson;G. L. Nembauser;M. W. P. Savelsbergh;P. H. Vance
  2. Advances in Computing Research : VLSI theory v.2 VLSI routing : Four layers suffice Brady, M. L.;D. J. Brown;F. P. Preparata(ed.)
  3. Advances in CAD for VLSI : Layout Design and Verification v.4 Channel Routing Burstein, M.;T. Ohtsuki
  4. IEEE Transactions on Computer-Aided-Design v.CAD-2 Hierarchical wire routing Burstein, M.;R. Pelavin
  5. IEEE Transactions on Computer-Aided-Design v.CAD-7 BEAVER : A computational-geometry-based tool for switchbox routing Cohoon, J. P.;P. L. Heck
  6. The Steiner problem in graphs, Networks v.1 Dreyfus, S. E.;R. A. Wagner
  7. Mathematics of Operation Research v.12 Send-and-split method for minimum-concave-cost network flows Erickson, R. E.;C. L. Monma;A. F. JR. Veinott
  8. SIAM Journal of Applied Mathematics v.32 The rectilinear Steiner tree problem is NP-Complete Garey, M. R.;D. S. Johnson
  9. Mathematical Programming v.72 Packing Steiner tree : polyhedral investigations Grotschel, M.;A. Martin;R. Weismantel
  10. Mathematical Programming v.72 Packing Steiner tree : a cutting plane algorithm and computational results Grotschel, M.;A. Martin;R. Weismantel
  11. Networks v.22 Steiner tree problems Hwang, F. K.;D. S. Richards
  12. Mathematical Programming v.62 Min-cut clustering Johnson, E. L.;Mehrotra;G. L. Nemhauser
  13. Combinatorial Algorithms for Integrated Circuit Layout Lengauer, T.
  14. Advances in Computing Research : VLSI theory v.2 On the Structure of Three-Layer Wireable Layouts Lipski, W.;F. P. Preparata(ed.)
  15. Integration v.3 A Greedy Switchbox Router Luk, W. K.
  16. Integer and Combinatorial Optimization Nemhauser, G. L.;L. A. Wolsey
  17. Complexity of Computer Computations Reducibility among Combinatorial Problems Karp, R. M.;R. E. Miller(ed.);J. W. Thatcher(ed.)
  18. Advances in Computing Research: VLSI theory v.2 The Complexity of Wire-Routing and Finding Minimum Area Layouts for Arbitrary VLSI Circuits Kramer, M. R.;J. V. Leeuwen;F. P. Preparata(ed.)
  19. Management Science v.42 An integer programming approach to the bandwidth packing problem Park, K.;S. Kang;S. Park
  20. IEEE Transactions on Computer-Aided-Design v.CAD-6 Channel-routing problem in the knock-knee mode is NP-Complete Sarrafzadeh, M.
  21. Operations Research v.45 A branch-and price algorithm for the generalized assignment problem Savelsbergh, M. W. P.
  22. Networks v.17 The Steiner problems in networks : A survey Winter, P.
  23. VLSI Physical Design Automation Sait, M.;H. Youssef