Lagrangean based methods for solving large-scale cellular networks design problems

Wireless Networks

Volumn 9, Issue 6, 2003, Pages 659-672

  Mazzini, Filipe F ^a   Mateus, Geraldo R ^a   Smith, James MacGregor ^b  

^a FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

^b University of Massachusetts   (United States)

Author keywords

Algorithms; Base station location; Cellular network design; Frequency channel assignment; Optimization

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; GRADIENT METHODS; HEURISTIC METHODS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; TELECOMMUNICATION NETWORKS;

BASE STATION LOCATION; CELLULAR NETWORK DESIGN; FREQUENCY CHANNEL ASSIGNMENT; LAGRANGEAN RELAXATION; TOPOLOGICAL NETWORK DESIGN;

CELLULAR RADIO SYSTEMS;

EID: 0242667866     PISSN: 10220038     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025964603779     Document Type: Article

References (51)

1. E. Amaldi, A. Capone and F. Malucelli, Discrete models and algorithms for the capacitated location problems arising in umts network planning. in: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (ACM Press, 2001) pp. 1-8.
2. E. Amaldi, A. Capone and F. Malucelli, Optimizing base station siting in UMTS networks, in: Proceedings of VTC Spring 2001 (2001).
3. K.I. Ardal, A. Hipolito, C.P.M. van Hoesel and B. Jansen, A branch-and-cut algorithm for the frequency assignment problem, Technical Report Annex T-2.2.1, Department of Mathematics and Computing Science, T. U. Eindhoven, Eindhoven, The Netherlands (1995).
4. L. Bahiense, N. Maculan and C. Sagastizábal, On the convergence of the volume algorithm, in: Proceedings of 17th International Symposium on Mathematical Programming, School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA (2000).
5. F. Barahona and R. Anbil, The volume algorithm: producing primal solutions with a subgradient method, Mathematical Programming 87(3) (2000) 385-399.
6. M.S. Bazaraa, J.J. Jarvis and H.D. Sherali, Linear Programming and Network Flows, 2nd edn. (Wiley, New York, 1990).
7. R. Borndörfer, A. Eisenblätter, M. Grötschel and A. Martin, The orientation model for frequency assignment problems, Technical Report TR 98-01, Konrad-Zuse-Zentrum für Informationstechnik Berlin, Berlin, Germany (1997).
8. R. Borndörfer, A. Eisenblätter, M. Grötschel and A. Martin, Frequency assignment in cellular phone networks, Annals of Operations Research 76 (1998) 73-93.
9. D.J. Castelino, S. Hurley and S.U. Thiel, A tabu search algorithm for frequency assignment, Annals of Operations Research 63 (1996) 1497-1514.
10. CPL (1997), CPLEX: Using the CPLEX Callable Library, Version 5.0.
11. M.A. DeSousa, J.R. Formigoni, M.A. Bergamaschi, O.C. Branquinho, J.S. Yamamoto, J. Machado and C.M.C. Filho, Planejamento otimizado da infra-estrutura de rede celular, in: XVIII Simpósio Brasileiro de Telecomunicacoẽes - SBT2000, Gramado, RS, Brazil (2000).
12. A. Dutta and P. Kubat, Design of partially survivable networks for cellular telecommunication systems, European Journal of Operational Research 118 (1999) 52-64.
13. C.E. Ferreira and Y. Wakabayashi, Combinatória poliédrica e planosde-corte faciais, in: 10a Escola de Computacão, Campinas, SP, Brazil (1996).
14. M. Fischetti, C. Lepschy, G. Minerva and G. Romanin-Jacur, Frequency assignment in mobile radio systems using branch-and-cut techniques, European Journal of Operational Research 123 (2000) 241-255.
15. M.L. Fisher, The Lagrangean relaxation method for solving integer programming problems, Management Science 27(1) (1981) 1-18.
16. M.L. Fisher, An application oriented guide to Lagrangean relaxation, Interfaces 15(2) (1985) 10-21.
17. M.L. Fisher, W.D. Northup and J.P. Shapiro, Using duality to solve discrete optimization problems: Theory and computational experience, Mathematical Programming Study 3 (1975) 56-94.
18. L.C.P. Floriani, Otimizaç̃o no planejamento de capacidade de sistemas pessoais de comunição sem fio, Master's thesis, Departamento de Ciência da Computacão, Universidade Federal de Mimas Gerais, Belo Horizonte, MG (1998).
19. L.C.P. Floriani and G.R. Mateus, Optimization models for effective cell planning design, in: Proceedings of the First International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Budapest, Hungary (1997).
20. R. Fourer, D. M. Gay and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming (Boyd & Fraser, 1993).
21. M. Galota, C. Glaßer, S. Reith and H. Vollmer, A polynomial-time approximation scheme for base station positioning in umts networks, in: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (ACM Press, 2001) pp. 52-59.
22. A. Geoffrion, Lagrangean relaxation applied to capacitated facility location problems, AIIE Transactions 10(1) (1978).
23. A.M. Geoffrion, Lagrangean relaxation and its uses in integer programming, Mathematical Programming Study 2 (1974) 82-114.
24. C. Glaßer, S. Reith and H. Vollmer, The complexity of base station positioning in cellular networks, in: Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), Approximation and Randomized Algorithms in Communication Networks, Proceedings of ICALP Workshops 2000 (2000) pp. 167-177, http://citeseer.nj.nec.com/337023.html
25. W.K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE 68 (1980) 1497-1514.
26. M.H. Held, P. Wolfe and H.D. Crowder, Validation of subgradient optimization, Mathematical Programming 6(1) (1974) 62-88.
27. C.A.J. Hurkens and S.R. Tiourine, Upper and lower bounding techniques for frequency assignment problems, Technical Report Memorandum COSOR 95-34, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands (1995).
28. S. Hurley, D. Smith and S.U. Thiel, Fasoft: A system for discrete channel frequency assignment, Radio Science 32(5) (1995) 1921-1932.
29. S. Hurley, S.U. Thiel and D. Smith, A comparison of local search algorithms for radio link frequency assignment problems, in: ACM Symposium on Applied Computing (1996) pp. 251-257.
30. B. Jaumard and T. Vovor, A column generation approach for the exact solution of channel assignment problems, Technical Report Les Cahiers du GERAD G-98-39, Département de Mathématiques et de Génie Industriel, École Polytechnique de Montréal, Montréal (Québec), Canada (1998).
31. P. Kubat and J.M. Smith, A multi-period network design problem for cellular telecommunications systems, Technical report, Department of Mechanical and Industrial Engineering, University of Massachusetts, Amherst, MA (2000).
32. L.S. Lasdon, Optimization Theory for Large Systems (Macmillan, 1971).
33. W.C.Y. Lee, Mobile Cellular Telecommunications Systems (McGraw-Hill, 1989).
34. I.J. Lustig, R.E. Marsten and D.F. Shanno, Interior point methods for linear programming: Computational state of the art, ORSA Journal on Computing 6 (1994) 1-14.
35. G.R. Mateus and A.A. Loureiro, Introdução à computação móvel, in: 11a Escola de Computação, Rio de Janeiro, RJ (1998).
36. R. Mathar and T. Niessem, Optimum position of base stations for cellular radio networks, Wireless Networks 6 (2000) 421-428.
37. R. Mathar and M. Schmeink, Optimal base station positioning and channel assignment for 3G mobile networks by integer programming, Technical report, RWTH Aachen, Aachen, Germany (2000).
38. F.F. Mazzini, Modelos e algoritmos para o projeto de redes celulares, Master's thesis, Departamento de Ciência da Computação, Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil (2001).
39. F.F. Mazzini and G.R. Mateus, A mixed-integer programming model for the cellular telecommunication network design, in: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (ACM Press, 2001) pp. 68-76.
40. F.F. Mazzini, G.R. Mateus and H.P.L. Luna, Cellular telecommunication network desing, in: ALGOTEL'2001 - Actes 3èmes rencontres francophones sur les aspects algoritmiques des télécommunications, Saint Jean de Luz, France (2001).
41. P.B. Mirchandani and R.L. Francis, Discrete Location Theory (Wiley Interscience, 1990).
42. G.L. Nemhauser and L.A. Wosley, Integer and Combinatorial Optimization (Wiley, 1988).
43. People working on freqeuncy assignment, http://www.crt.umontreal.ca/~christop/telecom_net.html
44. T.S. Rappaport, Wireless Communications: Principles & Practice (Prentice-Hall, 1996).
45. C.R. Reeves, Modern Heuristics Techniques for Combinatorial Problems (Wiley, 1993).
46. K. Schneider, Frequency assignment in mobile communication using local search algorithms, Master's thesis, Department of Mathematics, Technische Universität Berlin, Berlin, Germany (1997).
47. J.F. Shapiro, Mathematical Programming Structures and Algorithms (Wiley, New York, 1979).
48. D. Smith, S. Allen, S. Hurley and J. Watkins, Frequency assignment: Methods and algorithms, Global Communications (1998) 110-127.
49. D. Smith and S. Hurley, Bounds for the frequency assignment problem, Discrete Mathematics 167/168 (1997) 571-582.
50. D. Smith, S. Hurley and S.U. Thiel, Improving heuristics for the frequency assignment problem, European Journal of Operational Research 107 (1998) 76-86.
51. S. Tiourine, C. Hurkens and J.K. Lenstra, An overview of algorithmic approaches to frequency assignment problems, Technical report, Department of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands (1995).