{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T02:37:45Z","timestamp":1755225465652,"version":"3.43.0"},"reference-count":51,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Networks"],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1023\/a:1025964603779","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T18:52:54Z","timestamp":1067021574000},"page":"659-672","source":"Crossref","is-referenced-by-count":14,"title":["Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems"],"prefix":"10.1007","volume":"9","author":[{"given":"Filipe F.","family":"Mazzini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Geraldo R.","family":"Mateus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James MacGregor","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5144397_CR1","doi-asserted-by":"crossref","unstructured":"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\u20138.","DOI":"10.1145\/381448.381449"},{"key":"5144397_CR2","unstructured":"E. Amaldi, A. Capone and F. Malucelli, Optimizing base station siting in UMTS networks, in: Proceedings of VTC Spring 2001 (2001)."},{"key":"5144397_CR3","volume-title":"Technical Report Annex T-2.2.1, Department of Mathematics and Computing Science","author":"K.I. Ardal","year":"1995","unstructured":"K.I. Ardal, A. Hipolito, C.P.M. van Hoesel and B. Jansen, A branchand-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)."},{"key":"5144397_CR4","unstructured":"L. Bahiense, N. Maculan and C. Sagastiz\u00e1bal, 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)."},{"issue":"3","key":"5144397_CR5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"F. Barahona and R. Anbil, The volume algorithm: producing primal solutions with a subgradient method, Mathematical Programming 87(3) (2000) 385\u2013399.","journal-title":"Mathematical Programming"},{"key":"5144397_CR6","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"1990","unstructured":"M.S. Bazaraa, J.J. Jarvis and H.D. Sherali, Linear Programming and Network Flows, 2nd edn. (Wiley, New York, 1990).","edition":"2nd edn."},{"key":"5144397_CR7","volume-title":"The orientation model for frequency assignment problems, Technical Report TR 98-01","author":"R. Bornd\u00f6rfer","year":"1997","unstructured":"R. Bornd\u00f6rfer, A. Eisenbl\u00e4tter, M. Gr\u00f6tschel and A. Martin, The orientation model for frequency assignment problems, Technical Report TR 98-01, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik Berlin, Berlin, Germany (1997)."},{"key":"5144397_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1023\/A:1018908907763","volume":"76","author":"R. Bornd\u00f6rfer","year":"1998","unstructured":"R. Bornd\u00f6rfer, A. Eisenbl\u00e4tter, M. Gr\u00f6tschel and A. Martin, Frequency assignment in cellular phone networks, Annals of Operations Research 76 (1998) 73\u201393.","journal-title":"Annals of Operations Research"},{"key":"5144397_CR9","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1007\/BF02125459","volume":"63","author":"D.J. Castelino","year":"1996","unstructured":"D.J. Castelino, S. Hurley and S.U. Thiel, A tabu search algorithm for frequency assignment, Annals of Operations Research 63 (1996) 1497\u20131514.","journal-title":"Annals of Operations Research"},{"key":"5144397_CR10","unstructured":"CPL (1997), CPLEX: Using the CPLEX Callable Library, Version 5.0."},{"key":"5144397_CR11","volume-title":"XVIII Simp\u00f3sio Brasileiro de Telecomunica\u00e7\u00f5es \u2013 SBT2000","author":"M.A. DeSousa","year":"2000","unstructured":"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\u00f3sio Brasileiro de Telecomunica\u00e7\u00f5es \u2013 SBT2000, Gramado, RS, Brazil (2000)."},{"key":"5144397_CR12","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/S0377-2217(98)00281-1","volume":"118","author":"A. Dutta","year":"1999","unstructured":"A. Dutta and P. Kubat, Design of partially survivable networks for cellular telecommunication systems, European Journal of Operational Research 118 (1999) 52\u201364.","journal-title":"European Journal of Operational Research"},{"key":"5144397_CR13","unstructured":"C.E. Ferreira and Y. Wakabayashi, Combinat\u00f3ria poli\u00e9drica e planosde-corte faciais, in: 10a Escola de Computa\u00e7\u00e3o, Campinas, SP, Brazil (1996)."},{"key":"5144397_CR14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(99)00254-4","volume":"123","author":"M. Fischetti","year":"2000","unstructured":"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\u2013255.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5144397_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"M.L. Fisher, The Lagrangean relaxation method for solving integer programming problems, Management Science 27(1) (1981) 1\u201318.","journal-title":"Management Science"},{"issue":"2","key":"5144397_CR16","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"M.L. Fisher","year":"1985","unstructured":"M.L. Fisher, An application oriented guide to Lagrangean relaxation, Interfaces 15(2) (1985) 10\u201321.","journal-title":"Interfaces"},{"key":"5144397_CR17","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/BFb0120699","volume":"3","author":"M.L. Fisher","year":"1975","unstructured":"M.L. Fisher, W.D. Northup and J.F. Shapiro, Using duality to solve discrete optimization problems: Theory and computational experience, Mathematical Programming Study 3 (1975) 56\u201394.","journal-title":"Mathematical Programming Study"},{"key":"5144397_CR18","unstructured":"L.C.P. Floriani, Otimiza\u00e7\u00e3o no planejamento de capacidade de sistemas pessoais de comunica\u00e7\u00e3o sem fio, Master's thesis, Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade Federal de Minas Gerais, Belo Horizonte, MG (1998)."},{"key":"5144397_CR19","unstructured":"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)."},{"key":"5144397_CR20","unstructured":"R. Fourer, D.M. Gay and B.W. Kernighan, AMPL: A Modeling Language for Mathematical Programming (Boyd & Fraser, 1993)."},{"key":"5144397_CR21","doi-asserted-by":"crossref","unstructured":"M. Galota, C. Gla\u00dfer, 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\u201359.","DOI":"10.1145\/381448.381455"},{"key":"5144397_CR22","doi-asserted-by":"crossref","unstructured":"A. Geoffrion, Lagrangean relaxation applied to capacitated facility location problems, AIIE Transactions 10(1) (1978).","DOI":"10.1080\/05695557808975181"},{"key":"5144397_CR23","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion, Lagrangean relaxation and its uses in integer programming, Mathematical Programming Study 2 (1974) 82\u2013114.","journal-title":"Mathematical Programming Study"},{"key":"5144397_CR24","unstructured":"C. Gla\u00dfer, 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\u2013177, http: \/\/citeseer.nj.nec.com\/337023.html"},{"key":"5144397_CR25","first-page":"1497","volume":"68","author":"W.K. Hale","year":"1980","unstructured":"W.K. Hale, Frequency assignment: Theory and applications, Proceedings of the IEEE 68 (1980) 1497\u20131514.","journal-title":"Theory and applications, Proceedings of the IEEE"},{"issue":"1","key":"5144397_CR26","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","volume":"6","author":"M.H. Held","year":"1974","unstructured":"M.H. Held, P. Wolfe and H.D. Crowder, Validation of subgradient optimization, Mathematical Programming 6(1) (1974) 62\u201388.","journal-title":"Mathematical Programming"},{"key":"5144397_CR27","volume-title":"Technical Report Memorandum COSOR 95-34, Department of Mathematics and Computing Science","author":"C.A.J. Hurkens","year":"1995","unstructured":"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)."},{"issue":"5","key":"5144397_CR28","doi-asserted-by":"crossref","first-page":"1921","DOI":"10.1029\/97RS01866","volume":"32","author":"S. Hurley","year":"1995","unstructured":"S. Hurley, D. Smith and S.U. Thiel, Fasoft: A system for discrete channel frequency assignment, Radio Science 32(5) (1995) 1921\u20131932.","journal-title":"Radio Science"},{"key":"5144397_CR29","doi-asserted-by":"crossref","unstructured":"S. Hurley, S.U. Thiel and D. Smith, A comparision of local search algorithms for radio link frequency assignment problems, in: ACM Symposium on Applied Computing (1996) pp. 251\u2013257.","DOI":"10.1145\/331119.331186"},{"key":"5144397_CR30","volume-title":"Technical Report Les Cahiers du GERAD G-98-39, D\u00e9partement de Math\u00e9matiques et de G\u00e9nie Industriel","author":"B. Jaumard","year":"1998","unstructured":"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\u00e9partement de Math\u00e9matiques et de G\u00e9nie Industriel, \u00c9cole Polytechnique de Montr\u00e9al, Montr\u00e9al (Qu\u00e9bec), Canada (1998)."},{"key":"5144397_CR31","volume-title":"Technical report, Department of Mechanical and Industrial Engineering","author":"P. Kubat","year":"2000","unstructured":"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)."},{"key":"5144397_CR32","doi-asserted-by":"crossref","unstructured":"L.S. Lasdon, Optimization Theory for Large Systems (Macmillan, 1971).","DOI":"10.1109\/TSMC.1971.4308301"},{"key":"5144397_CR33","unstructured":"W.C.Y. Lee, Mobile Cellular Telecommunications Systems (McGraw-Hill, 1989)."},{"key":"5144397_CR34","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/ijoc.6.1.1","volume":"6","author":"I.J. Lustig","year":"1994","unstructured":"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\u201314.","journal-title":"Computational state of the art, ORSA Journal on Computing"},{"key":"5144397_CR35","unstructured":"G.R. Mateus and A.A. Loureiro, Introdu\u00e7\u00e3o \u00e0 computa\u00e7\u00e3o m\u00f3vel, in: 11a Escola de Computa\u00e7\u00e3o, Rio de Janeiro, RJ (1998)."},{"key":"5144397_CR36","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/A:1019263308849","volume":"6","author":"R. Mathar","year":"2000","unstructured":"R. Mathar and T. Niessem, Optimum position of base stations for cellular radio networks, Wireless Networks 6 (2000) 421\u2013428.","journal-title":"Wireless Networks"},{"key":"5144397_CR37","volume-title":"Technical report","author":"R. Mathar","year":"2000","unstructured":"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)."},{"key":"5144397_CR38","volume-title":"Modelos e algoritmos para o projeto de redes celulares","author":"F.F. Mazzini","year":"2001","unstructured":"F.F. Mazzini, Modelos e algoritmos para o projeto de redes celulares, Master's thesis, Departamento de Ci\u00eancia da Computa\u00e7\u00e3o, Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil (2001)."},{"key":"5144397_CR39","doi-asserted-by":"crossref","unstructured":"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\u201376.","DOI":"10.1145\/381448.381458"},{"key":"5144397_CR40","volume-title":"ALGOTEL'2001 \u2013 Actes 3\u00e8mes rencontres francophones sur les aspects algoritmiques des t\u00e9l\u00e9communications","author":"F.F. Mazzini","year":"2001","unstructured":"F.F. Mazzini, G.R. Mateus and H.P.L. Luna, Cellular telecommunication network desing, in: ALGOTEL'2001 \u2013 Actes 3\u00e8mes rencontres francophones sur les aspects algoritmiques des t\u00e9l\u00e9communications, Saint Jean de Luz, France (2001)."},{"key":"5144397_CR41","unstructured":"P.B. Mirchandani and R.L. Francis, Discrete Location Theory (Wiley Interscience, 1990)."},{"key":"5144397_CR42","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser and L.A. Wosley, Integer and Combinatorial Optimization (Wiley, 1988).","DOI":"10.1002\/9781118627372"},{"key":"5144397_CR43","unstructured":"People working on frequency assignment, http:\/\/www.crt. umontreal.ca\/~christop\/telecom_net.html"},{"key":"5144397_CR44","unstructured":"T.S. Rappaport, Wireless Communications: Principles & Practice (Prentice-Hall, 1996)."},{"key":"5144397_CR45","unstructured":"C.R. Reeves, Modern Heuristics Techniques for Combinatorial Problems (Wiley, 1993)."},{"key":"5144397_CR46","volume-title":"Frequency assignment in mobile communication using local search algorithms","author":"K. Schneider","year":"1997","unstructured":"K. Schneider, Frequency assignment in mobile communication using local search algorithms, Master's thesis, Department of Mathematics, Technische Universit\u00e4t Berlin, Berlin, Germany (1997)"},{"key":"5144397_CR47","volume-title":"Mathematical Programming Structures and Algorithms","author":"J.F. Shapiro","year":"1979","unstructured":"J.F. Shapiro, Mathematical Programming Structures and Algorithms (Wiley, New York, 1979)."},{"key":"5144397_CR48","unstructured":"D. Smith, S. Allen, S. Hurley and J. Watkins, Frequency assignment: Methods and algorithms, Global Communications (1998) 110\u2013127."},{"key":"5144397_CR49","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0012-365X(96)00257-9","volume":"167","author":"D. Smith","year":"1997","unstructured":"D. Smith and S. Hurley, Bounds for the frequency assignment problem, Discrete Mathematics 167\/168 (1997) 571\u2013582.","journal-title":"Discrete Mathematics"},{"key":"5144397_CR50","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0377-2217(98)80006-4","volume":"107","author":"D. Smith","year":"1998","unstructured":"D. Smith, S. Hurley and S.U. Thiel, Improving heuristics for the frequency assignment problem, European Journal of Operational Research 107 (1998) 76\u201386.","journal-title":"European Journal of Operational Research"},{"key":"5144397_CR51","volume-title":"Technical report, Department of Mathematics and Computing Science","author":"S. Tiourine","year":"1995","unstructured":"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)."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025964603779.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025964603779\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025964603779.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,13]],"date-time":"2025-08-13T11:51:24Z","timestamp":1755085884000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025964603779"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":51,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,11]]}},"alternative-id":["5144397"],"URL":"https:\/\/doi.org\/10.1023\/a:1025964603779","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"type":"print","value":"1022-0038"},{"type":"electronic","value":"1572-8196"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}