Exact solution of the SONET ring loading problem

DOI10.1016/S0167-6377(99)00031-0zbMath0934.90010OpenAlexW2035675328MaRDI QIDQ1962832

Francesco Maffioli, Mauro Dell'Amico, Martine Labbé

Publication date: 31 January 2000

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(99)00031-0

zbMATH Keywords

integer programmingbranch and boundstrongly polynomial algorithmlinear algorithmsynchronous optical networks

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Related Items (10)

The weighted link ring loading problem ⋮ An Improved Upper Bound for the Ring Loading Problem ⋮ Optimization in telecommunication networks ⋮ Online mixed ring covering problem with two nodes ⋮ SONET/SDH ring assignment with capacity constraints ⋮ Computing minimal solutions to the ring loading problem ⋮ A tabu search algorithm for self-healing ring network design. ⋮ On the ring loading problem with demand splitting. ⋮ Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. ⋮ A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting

Cites Work

• Algorithms for routing around a rectangle
• The Ring Loading Problem
• Multicommodity Flows in Ring Networks

This page was built for publication: Exact solution of the SONET ring loading problem