A multi-period network design problem for cellular telecommunication systems |
| |
| Institution: | 1. Verizon Laboratories Inc., 40 Sylvan Road, Waltham, MA 02451, USA;2. Department of Mechanical and Industrial Engineering, University of Massachusetts, Marston Hall, Room 111B, Amherst, MA 01003, USA;1. Department of Computer Science and Engineering, Dr. B.C. Roy Engineering College, Durgapur, India;2. Department of Computer Science and Engineering, National Institute of Technology, Durgapur, India;1. Electrical Engineering Department, CINVESTAV-Guadalajara, Guadalajara, Mexico;2. Faculty of Sciences, Pontificia Universidad Javeriana, Bogotá, Colombia;1. Quantcast, San Francisco, CA, USA;2. Operations Research, North Carolina State University, Raleigh, NC, USA;3. The Department of Computer Science, North Carolina State University, Raleigh, NC 27695-8206, USA;4. King Abdulaziz University, Saudi Arabia |
| |
| Abstract: | Mathematical Programming models for multi-period network design problems, which arise in cellular telecommunication systems are presented. The underlying network topologies range from a simple star to complex multi-layer Steiner-like networks. Linear programming, Lagrangian relaxation, and branch-and-cut heuristics are proposed and a polynomial-bounded heuristic based on an interior point linear programming implementation is described. Extensive computational results are presented on a number of randomly generated problem sets and the performance of the heuristic(s) are compared with an optimal branch-and-bound algorithm. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
