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

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

Design of Survivable Communication Networks with High-connectivity Constraints

  • Koh, Seok J. (Graduate School of Management, KAIST) ;
  • Lee, Chae Y. (Department of Industrial Management, Korea Advanced Institute of Science and Technology)
  • Published : 1997.09.01
Download PDF
⟨ Previous Next ⟩

Abstract

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.

Keywords

References

  1. SIAM Journal on Discrete Mathematics v.3 On the Structure of Minimum-Weight k-connected Spanning Networks Bienstock, D.;E. F. Brickell;C. L. Monma
  2. IEEE Journal on Selected Areas in Communications v.7 Computer-Aided Design Procedures for Survivable Fiber Optic Networks Cardwell, R. H.;C. L. Monma;T. H. Wu
  3. SIAM Journal on Discrete Mathematics v.5 Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity Problems S. Chopra
  4. SIAM Journal on Applied Mathematics v.9 Multi-Therminal Network Flows R. E. Gomory;T. C. Hu
  5. SIAM Journal on Discrete Mathematics v.3 Integer Polyhedra Associated with Certain Network Design Problems with Connectivity Constraints M. Groetschel;C. L. Monma
  6. SIAM Journal on Optimization v.2 Facets for polyhedra arising in the design of communication networks with low-connectivity constraints M. Groetschel;C. L. Monma;M. Stoer
  7. Operations Research v.40 Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low Connectivity Constraints M. Groetschel;C. L. Monma;M. Stoer
  8. Communications of ACM v.16 Algorithm 447: Efficient Algorithms for Graph Manipulation J. Hopcropt;R. E. Tarjan
  9. SIAM Journal on Computing v.2 Dividing a Graph into Triconnected Components J. Hopcropt;R. E. Tarjan
  10. Mathematical Programming v.46 Minimum-weight Two-connected Spanning Networks C. L. Monma;B. S. Munson;W. R. Pulleyblank
  11. Operations Research v.37 Methods for Designing Communications Networks with Certain Two-connected Survivability Constraints C. L. Monma;D. F. Shallcross
  12. Mathematical Programming v.47 An efficient Algorithm for the Minimum Capacity Cut Problem M. Padberg;G. Rinaldi
  13. Proceeding of IEEE International Symposium on Circuits and Systems 3-Connectivity Augmentation Problems T. Watanabe;A. Nakamura
  14. Discrete Applied Mathematics v.28 A Smallest 3-Connectivity Augmentation of a Graph T. Watanabe;A. Nakamura
  15. Journal of Computer and System Sciences v.46 A Minimum 3-Connectivity Augmentation of a Graph T. Watanabe;A. Nakamura
  16. Fiber Network Service Survivability T. H. Wu