Exact solution of the SONET ring loading problem

DOI10.1016/S0167-6377(99)00031-0zbMATH Open0934.90010OpenAlexW2035675328MaRDI QIDQ1962832FDOQ1962832

Authors: Mauro Dell'Amico, Martine Labbé, Francesco Maffioli 

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

Recommendations

• Optimal Load Balancing on Sonet Bidirectional Rings
• SONET/SDH ring assignment with capacity constraints
• A note on the ring loading problem
• The Ring Loading Problem
• The Ring Loading Problem

zbMATH Keywords

integer programmingbranch and boundstrongly polynomial algorithmlinear algorithmsynchronous optical networks

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (12)

• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
• On the ring loading problem with demand splitting.
• Title not available (Why is that?)
• Computing minimal solutions to the ring loading problem
• Online mixed ring covering problem with two nodes
• Optimization in telecommunication networks
• A tabu search algorithm for self-healing ring network design.
• Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
• SONET/SDH ring assignment with capacity constraints
• Exact algorithms for the master ring problem
• The weighted link ring loading problem
• An improved upper bound for the ring loading problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962832)