Multi-period capacity expansion for a local access telecommunications network

European Journal of Operational Research

Volumn 172, Issue 3, 2006, Pages 1051-1066

  Gendreau, Michel ^a   Potvin, Jean Yves ^a   Smires, Ali ^a   Soriano, Patrick ^a,b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b HEC MONTRÉAL   (Canada)

Author keywords

Capacity expansion; Heuristic; Local access network; Multi period; Telecommunications

Indexed keywords

COST EFFECTIVENESS; DECISION THEORY; ELECTRIC CABLES; HEURISTIC METHODS; INFORMATION RETRIEVAL; LOCAL AREA NETWORKS; TELECOMMUNICATION; TELECOMMUNICATION LINKS; TOPOLOGY; TREES (MATHEMATICS);

CAPACITY EXPANSIONS; HEURISTICS; LOCAL ACCESS NETWORKS; MULTI-PERIOD CAPACITY; NUMERICAL RESULTS;

TELECOMMUNICATION SYSTEMS;

EID: 33646504424     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.12.006     Document Type: Article

References (16)

1. Balakrishnan A., Magnanti T.L., Shulman A., and Wong R.T. Models for planning capacity expansion in local access telecommunications network. Annals of Operations Research 33 (1991) 239-284
2. Balakrishnan A., Magnanti T.L., and Wong R.T. A decomposition algorithm for local access telecommunications network expansion planning. Operations Research 43 (1995) 58-76
3. Chang S.-G., and Gavish B. Telecommunications network topological design and capacity expansion: Formulation and algorithms. Telecommunications Systems 1 (1993) 99-131
4. Chang S.-G., and Gavish B. Lower bounding procedures for multiperiod telecommunications network expansion problems. Operations Research 43 (1995) 43-57
5. Chardaire P. Hierarchical two level location problems. In: Sanso B., and Soriano P. (Eds). Telecommunications Network Planning (1999), Kluwer 33-54
6. M. Chen, A.S. Alfa, A model for planning multi-period local access communication network, Working Paper, University of Regina, 1996.
7. Christofides N., and Brooker P. Optimal expansion of an existing network. Mathematical Programming 6 (1974) 197-211
8. Doulliez P., and Rao R. Optimal network capacity planning: A shortest path scheme. Operations Research 23 (1975) 811-818
9. C. Dupuis, Résolution d'un probleme de la capacité dans un réseau de télécommunications, Mémoire de maitrise, Université de Montréal, 1998.
10. Dutta A., and Lim J.-I. A multiperiod capacity planning model for backbone computer communication networks. Operations Research 40 (1992) 689-705
11. Flippo O.E., Kolen A.W.J., Koster A.M.C.A., and van de Leensel R.L.M.J. A dynamic programming algorithm for the local access telecommunication network expansion problem. European Journal of Operational Research 127 (2000) 189-202
12. Gouveia L., and Paixâo J. Dynamic programming based heuristics for the topological design of local access networks. Annals of Operations Research 33 (1991) 305-327
13. Gouveia L., and Lopes M.J. Using generalized capacitated trees for designing the topology of local access networks. Telecommunications Systems 7 (1997) 315-337
14. Mateus G.R., and Franqueira R.V.L. Model and heuristic for a generalized access network design problem. Telecommunications System 15 (2000) 257-271
15. Parrish S., Cox T., Kuehner W., and Qiu Y. Planning for optimal expansion of leased line communications networks. Annals of Operations Research 36 (1992) 347-364
16. Zadeh N. On building minimum cost communication networks over time. Networks 4 (1974) 19-34