A multi-period network design problem for cellular telecommunication systems

European Journal of Operational Research

Volumn 134, Issue 2, 2001, Pages 439-456

  Kubat, Peter ^a   Smith, J MacGregor ^b  

^a Verizon Laboratories   (United States)

^b University of Massachusetts   (United States)

Author keywords

Cellular; Heuristics; Multi period; Telecommunications network design

Indexed keywords

ALGORITHMS; CELLULAR RADIO SYSTEMS; COMPUTATIONAL METHODS; HEURISTIC METHODS; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; POLYNOMIALS; RANDOM NUMBER GENERATION; RELAXATION PROCESSES; TELECOMMUNICATION NETWORKS;

BRANCH-AND-BOUND ALGORITHMS; STEINER-LIKE NETWORKS;

OPERATIONS RESEARCH;

EID: 0035900027     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(00)00271-X     Document Type: Article

References (14)

1. Design of partially survivable networks for cellular telecommunication systems 1999
2. Lagrangean relaxation for integer programming
3. Interconnect facilities planning for cellular telephone networks
4. On the design of cellular networks with diversity and capacity constraints
5. Modeling and solving the two-facility capacitated network loading problem
6. An exact algorithm for large multiple knapsack problems
7. Optimization of the interconnection links in cellular telephone networks