An algorithm for designing rings for survivable fiber networks

DOI10.1109/24.93762MaRDI QIDQ3356005zbMATH OpenOpenAlexFDO

Authors 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

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

Cited in

(6)

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

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

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