Fast heuristics for protection networks for dynamic routing

Journal of the Operational Research Society

Volumn 50, Issue 3, 1999, Pages 262-267

  Ouveysi, I ^a   Wirth, A ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Heuristics; Networks and graphs; Telecommunications

Indexed keywords

HIGH SPEED NETWORK SERVICES; PROTECTION NETWORKS; TWO-HOP DYNAMIC ROUTING;

HEURISTIC METHODS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SERVICES; TELECOMMUNICATION TRAFFIC;

OPERATIONS RESEARCH;

EID: 0033101282     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600665     Document Type: Article

References (7)

1. Gibbens RJ and Kelly FP (1990). Dynamic routing in fully connected networks. IMA JMath Control &Infor 7: 77-111.
2. Gomory RE and Hu TC (1961). Multi-terminal network flows. J Soc Ind Appl Math 9: 551-570.
3. Monma CL, Munson BS and Pulleyblank WR (1990). Minimum- weight two-connected spanning networks. Math Prog 46: 153-171.
4. Grotschel M, Monma CL and Stoer M (1992). Computational results with a cutting plane algorithm for designing networks with low-connectivity constraints. Opns Res 40: 309-330.
5. Grotschel M, Monma CL and Stoer M (1995). Polyhedral and computational investigations for designing communication networks with high survivability requirements. Opns Res 43: 1012-1024.
6. Gomory RE and Hu TC (1962). An application of generalized linear programming to network flows. J Soc Ind Appl Math 10: 260-283.
7. Ouveysi I and Wirth A (1999). On design of a survivable network architecture for dynamic routing: Optimal solution strategy and an efficient heuristic. Eur J Opl Res (to appear).