Clustering for the Design of SONET Rings in Interoffice Telecommunications

DOI10.1287/mnsc.40.11.1533zbMath0823.90040OpenAlexW1986553570MaRDI QIDQ4834361

Manuel Laguna

Publication date: 28 May 1995

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.40.11.1533

zbMATH Keywords

tabu searchnetwork designtelecommunications networkssynchronous optical networklogical rings

Mathematics Subject Classification ID

Mixed integer programming (90C11) Communication networks in operations research (90B18)

Related Items (11)

Metaheuristics: A bibliography ⋮ SONET/SDH ring assignment with capacity constraints ⋮ Covering a graph with cycles. ⋮ Designing tributary networks with multiple ring families. ⋮ A tabu search algorithm for self-healing ring network design. ⋮ Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network. ⋮ A branch-and-cut algorithm for solving an intraring synchronous optical network design problem ⋮ Approximation algorithms for the design of SDH/SONET networks ⋮ An optimization problem arising in the design of multiring systems ⋮ Comparing metaheuristic algorithms for SONET network design problems ⋮ Modelling the load levelling problem in master production scheduling for MRP systems

This page was built for publication: Clustering for the Design of SONET Rings in Interoffice Telecommunications