Wide area telecommunication network design: Application to the Alberta SuperNet

Journal of the Operational Research Society

Volumn 59, Issue 11, 2008, Pages 1460-1470

  Cabral, E A ^a   Erkut, E ^b   Laporte, G ^c   Patterson, R A ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

^b BILKENT UNIVERSITY   (Turkey)

^c HEC MONTRÉAL   (Canada)

Author keywords

Heuristic; Network design; Telecommunications

Indexed keywords

DESIGN; TABU SEARCH; TELECOMMUNICATION;

BROADBAND INTERNET ACCESS; HEURISTIC; LOADING PROBLEM; NETWORK DESIGN; SOLUTION METHODOLOGY; TABU SEARCH ALGORITHMS; TELECOMMUNICATION NETWORK DESIGN; TRANSPORT TECHNOLOGY;

WIDE AREA NETWORKS;

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

References (28)

1. Armony M, Klincewicz JG, Luss H and Rosenwein MB (2000). Design of stacked self-healing rings using a genetic algorithm. J Heuristics 6: 85-105.
2. Balakrishnan A, Magnanti TL and Mirchandani PB (1997). Network design. In: Dell'Amico M, Maffioli MF and Martello S (eds). Annotated Bibliographies in Combinatorial Optimization. Wiley: Chichester.
3. Balakrishnan A, Magnanti TL and Mirchandani PB (1998). Designing hierarchical survivable networks. Opns Res 46: 116-136.
4. Cabral EA, Erkut E, Laporte G and Tjandra SA (2005). The shortest path problem with relays. Unpublished manuscript.
5. Cabral EA, Erkut E, Laporte G and Patterson RA (2007). The network design problem with relays. Eur J Opl Res, 180: 834-844.
6. Chamberland S and Sansò B (2000). Topological expansion of multiple-ring metropolitan area networks. Networks 36: 210-224.
7. Chamberland S and Sansò B (2001). On the design problem of multitechnology networks. INFORMS Journal on Computing 13: 245-256.
8. Chamberland S, Sansò B and Marcotte O (2000). Topological design of two-level telecommunication networks with modular switches. Opns Res 48: 745-760.
9. Chopra S and Tsai C-Y (2002). A branch-and-cut approach for minimum cost multi-level network design. Disc Math 242: 65-92.
10. Costa AM (2005). A survey on Benders decomposition applied to fixed-charge network design problems. Comput Opl Res 32: 1429-1450.
11. Costa AM, Cordeau J-F and Laporte G (2006). Steiner tree problems with profits. INFOR 44: 99-115.
12. Doverspike R and Saniee I (2000). Heuristic Approaches for Telecommunications Network Management, Planning and Expansion. Kluwer: Boston.
13. Gavish B (1992). Topological design of computer communication networks-The overall design problem. Eur J Opl Res 58: 149-172.
14. Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comput Opl Res 13: 533-549.
15. Gzara F and Goffin J-L (2005). Exact solution of the centralized network design problem on directed graphs. Networks 45: 181-192.
16. Kerivin H and Mahjoub AR (2005). Design of survivable networks: A survey. Networks 46: 1-21.
17. Koch T and Martin A (1998). Solving Steiner tree problems in graphs to optimality. Networks 32: 207-232.
18. Labbé M, Laporte G, Rodrigues Martín I and Salazar González JJ (2004). The ring star problem: Polyhedral analysis and exact algorithm. Networks 43: 177-189.
19. Lucena A and Beasley JE (1998). A branch and cut algorithm for the Steiner problem in graphs. Networks 31: 39-59.
20. Magnanti TL and Raghavan S (2005). Strong formulations for network design problems with connectivity requirements. Networks 45: 61-79.
21. Patterson RA, Pirkul H and Rolland E (1999). A memory adaptive reasoning technique for solving the capacitated minimum spanning tree problem. J Heuristics 5: 159-180.
22. Polzin T and Vahdati Daneshmand S (2001a). A comparison of Steiner tree relaxations. Disc Appl Math 112: 241-261.
23. Polzin T and Vahdati Daneshmand S (2001b). Improved algorithms for the Steiner problem in networks. Disc Appl Math 112: 263-300.
24. Polzin T and Vahdati Daneshmand S (2003). On Steiner trees and minimum spanning trees in hypergraphs. Opns Res Lett 31: 12-20.
25. Raghavan S and Magnanti TL (1997). Network connectivity. In: Dell'Amico M, Maffioli F and Martello S (eds). Annotated. Bibliographies in Combinatorial Optimization. Wiley: Chichester,
26. Randazzo CD and Luna HPL (2001). A comparison of optimal methods for local access uncapacitated network design. Ann Opns Res 106: 263-286.
27. Sansò B and Soriano P (1999). Telecommunications Network Planning. Kluwer: Boston.
28. Takahashi H and Matsuyama A (1980). An approximate solution for the Steiner problem in graphs. Math Japon 24: 573-577.