Fast heuristics for protection networks for dynamic routing

DOI10.1057/palgrave.jors.2600665zbMath1054.90527OpenAlexW2060977345MaRDI QIDQ3157322

Andrew Wirth, Iradj Ouveysi

Publication date: 13 January 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600665

zbMATH Keywords

heuristicstelecommunicationsnetworks and graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Mathematical models for failure reconfiguration of telecommunication networks: Part 1 ⋮ On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic

This page was built for publication: Fast heuristics for protection networks for dynamic routing