An algorithm for designing rings for survivable fiber networks

DOI10.1109/24.93762zbMath0729.90943OpenAlexW2137424455MaRDI QIDQ3356005

Ondria J. Wasem

Publication date: 1991

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/c6356f74fca5884f7150a052ab550159f5f91253

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Reliability, availability, maintenance, inspection in operations research (90B25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

A new formulation and approach for the black and white traveling salesman problem ⋮ A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach ⋮ Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem ⋮ Designing tributary networks with multiple ring families. ⋮ A tabu search algorithm for self-healing ring network design. ⋮ Heuristics for the black and white traveling salesman problem

This page was built for publication: An algorithm for designing rings for survivable fiber networks