On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic

DOI10.1016/S0377-2217(98)00015-0zbMath0998.90506MaRDI QIDQ1847145

Andrew Wirth, Iradj Ouveysi

Publication date: 17 November 2002

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

zbMATH Keywords

linear programmingheuristicssurvivabilitydynamic routing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (4)

Survivable network design under optimal and heuristic interdiction scenarios ⋮ The multi-terminal maximum-flow network-interdiction problem ⋮ Mathematical models for failure reconfiguration of telecommunication networks: Part 1 ⋮ Mathematical models for failure reconfiguration of telecommunication networks: Part 2

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Fast heuristics for protection networks for dynamic routing
• An Application of Generalized Linear Programming to Network Flows
• Dynamic Routing in Fully Connected Networks
• Multi-Terminal Network Flows
• Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems

This page was built for publication: On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic