{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T08:37:03Z","timestamp":1765960623196},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,6,13]],"date-time":"2009-06-13T00:00:00Z","timestamp":1244851200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10589-009-9264-3","type":"journal-article","created":{"date-parts":[[2009,6,12]],"date-time":"2009-06-12T14:53:14Z","timestamp":1244818394000},"page":"533-551","source":"Crossref","is-referenced-by-count":5,"title":["Planning wireless networks by shortest path"],"prefix":"10.1007","volume":"48","author":[{"given":"C.","family":"Mannino","sequence":"first","affiliation":[]},{"given":"S.","family":"Mattia","sequence":"additional","affiliation":[]},{"given":"A.","family":"Sassano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,13]]},"reference":[{"issue":"1\u20133","key":"9264_CR1","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"K.R. Ahuja","year":"2002","unstructured":"Ahuja, K.R., Ergun, \u00cb., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. 123(1\u20133), 75\u2013102 (2002)","journal-title":"Discrete Appl. Math."},{"key":"9264_CR2","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T.L., Orlin, J.: Network Flows. Prentice Hall, New York (1993)"},{"key":"9264_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/381448.381449","volume-title":"Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M)","author":"E. Amaldi","year":"2001","unstructured":"Amaldi, E., Capone, A., Malucelli, F.: Discrete models and algorithms for the capacitated location problem arising in UMTS network planning. In: Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M), pp. 1\u20138. ACM, New York (2001)"},{"key":"9264_CR4","volume-title":"Handbook of Optimization in Telecommunication","author":"E. Amaldi","year":"2006","unstructured":"Amaldi, E., Capone, A., Malucelli, F., Mannino, C.: Optimization problems and models for planning cellular networks. In: Resende, M., Pardalos, P. (eds.) Handbook of Optimization in Telecommunication. Springer, Berlin (2006)"},{"key":"9264_CR5","volume-title":"Antenna Theory: Analysis and Design","author":"C.A. Balanis","year":"1982","unstructured":"Balanis, C.A.: Antenna Theory: Analysis and Design. Wiley, New York (1982)"},{"key":"9264_CR6","volume-title":"Frequency Assignment and Network Planning for Digital Terrestrial Broadcasting Systems","author":"R. Beutler","year":"2004","unstructured":"Beutler, R.: Frequency Assignment and Network Planning for Digital Terrestrial Broadcasting Systems. Kluwer Academic, Dordrecht (2004)"},{"key":"9264_CR7","unstructured":"The Chester 1997: Multilateral Coordination Agreement, Technical Criteria, Coordination Principles and Procedures for the introduction of Terrestrial Digital Video Broadcasting, 25 July 1997"},{"key":"9264_CR8","unstructured":"ILOG-CPLEX solver. http:\/\/www.ilog.fr"},{"key":"9264_CR9","doi-asserted-by":"crossref","unstructured":"Eisenbl\u00e4tter, A., Geerdes, H., Koch, T., Martin, A., Wess\u00e4ly, R.: (UMTS) Radio network evaluation and optimization beyond snapshots. Math. Methods Oper. Res. 63(1) (2006)","DOI":"10.1007\/s00186-005-0002-z"},{"issue":"3","key":"9264_CR10","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/ijoc.1040.0129","volume":"18","author":"J. Kalvenes","year":"2006","unstructured":"Kalvenes, J., Kennington, J., Olinick, E.: Base station location and service assignments in W-CDMA networks. INFORMS J. Comput. 18(3), 366\u2013376 (2006)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"9264_CR11","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1060.0312","volume":"54","author":"C. Mannino","year":"2006","unstructured":"Mannino, C., Rossi, F., Smriglio, S.: The network packing problem in terrestrial broadcasting. Oper. Res. 54(3), 611\u2013626 (2006)","journal-title":"Oper. Res."},{"issue":"1","key":"9264_CR12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1504\/IJMNDI.2005.007937","volume":"1","author":"R. Mathar","year":"2005","unstructured":"Mathar, R., Schmeinck, M.: Optimisation models for GSM radio. Int. J. Mobile Network Design Innov. 1(1), 70\u201375 (2005)","journal-title":"Int. J. Mobile Network Design Innov."},{"key":"9264_CR13","unstructured":"Naoum-Sawaya, J.: New benders decomposition approaches for W-CDMA telecommunication network design. Ph.D. Thesis, University of Waterloo (2007). http:\/\/www.uwspace.uwaterloo.ca\/bitstream\/10012\/2769\/1\/joe_naoum_sawaya_thesis.pdf"},{"key":"9264_CR14","volume-title":"The Mobile Radio Propagation Channel","author":"D. Parsons","year":"1998","unstructured":"Parsons, D.: The Mobile Radio Propagation Channel. Wiley, New York (1998)"},{"key":"9264_CR15","unstructured":"Regional Radiocommunication Conference (RRC-06). Final Act. http:\/\/www.itu.int\/ITU-R\/conferences\/rrc\/rrc-06\/index.asp"},{"key":"9264_CR16","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1023\/A:1014915519359","volume":"107","author":"F. Rossi","year":"2001","unstructured":"Rossi, F., Sassano, A., Smriglio, S.: Models and algorithms for terrestrial digital broadcasting. Ann. Oper. Res. 107, 267\u2013283 (2001)","journal-title":"Ann. Oper. Res."},{"key":"9264_CR17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/PL00009261","volume":"23","author":"G. Ramalingam","year":"1999","unstructured":"Ramalingam, G., Song, J., Joskowicz, L., Miller, R.E.: Solving systems of difference constraints incrementally. Algorithmica 23, 261\u2013275 (1999)","journal-title":"Algorithmica"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9264-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-009-9264-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-009-9264-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:36Z","timestamp":1559302596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-009-9264-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,13]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9264"],"URL":"https:\/\/doi.org\/10.1007\/s10589-009-9264-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,13]]}}}