A branch-and-cut algorithm for solving an intraring synchronous optical network design problem

DOI<223::AID-NET6>3.0.CO;2-J 10.1002/(SICI)1097-0037(200005)35:3<223::AID-NET6>3.0.CO;2-JzbMath0985.90093OpenAlexW2101186575MaRDI QIDQ4488863

Hanif D. Sherali, Junghee Han, Youngho Lee, Seong-In Kim

Publication date: 9 July 2000

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200005)35:3<223::aid-net6>3.0.co;2-j

zbMATH Keywords

branch-and-cutsurvivable network designvalid inequalitytelecommunications networksSONET ring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items (6)

SONET/SDH ring assignment with capacity constraints ⋮ Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. ⋮ A ring-mesh topology design problem for optical transport networks ⋮ Approximation algorithms for the design of SDH/SONET networks ⋮ Cutting plane algorithms for solving a stochastic edge-partition problem ⋮ Comparing metaheuristic algorithms for SONET network design problems

Cites Work

• Unnamed Item
• Min-cut clustering
• Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
• Clustering for the Design of SONET Rings in Interoffice Telecommunications

This page was built for publication: A branch-and-cut algorithm for solving an intraring synchronous optical network design problem