Exact solution of the SONET ring loading problem
From MaRDI portal
Publication:1962832
DOI10.1016/S0167-6377(99)00031-0zbMath0934.90010MaRDI QIDQ1962832
Francesco Maffioli, Mauro Dell'Amico, Martine Labbé
Publication date: 31 January 2000
Published in: Operations Research Letters (Search for Journal in Brave)
integer programming; branch and bound; strongly polynomial algorithm; linear algorithm; synchronous optical networks
90C10: Integer programming
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90B18: Communication networks in operations research
Related Items
Optimization in telecommunication networks, The weighted link ring loading problem, A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting, SONET/SDH ring assignment with capacity constraints, 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.
Cites Work