{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:21:03Z","timestamp":1762251663261},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,10,30]],"date-time":"2010-10-30T00:00:00Z","timestamp":1288396800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1007\/s10732-010-9148-9","type":"journal-article","created":{"date-parts":[[2010,11,3]],"date-time":"2010-11-03T14:19:35Z","timestamp":1288793975000},"page":"615-635","source":"Crossref","is-referenced-by-count":2,"title":["An adaptive multi-start graph partitioning algorithm for structuring cellular networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Mat\u00edas","family":"Toril","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volker","family":"Wille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I\u00f1igo","family":"Molina-Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Walshaw","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,30]]},"reference":[{"issue":"4","key":"9148_CR1","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1109\/TWC.2004.830821","volume":"3","author":"P.S. Bhattacharjee","year":"2004","unstructured":"Bhattacharjee, P.S., Saha, D., Mukherjee, A.: An approach for location area planning in a personal communication services network (PCSN). IEEE Trans. Wirel. Commun. 3(4), 1176\u20131187 (2004)","journal-title":"IEEE Trans. Wirel. Commun."},{"key":"9148_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01581033","volume":"22","author":"C.G.E. Boender","year":"1982","unstructured":"Boender, C.G.E., Rinnooy Kan, A.H.G., Timmer, G.T., Stougie, L.: A stochastic method for global optimization. Math. Program. 22, 125\u2013140 (1982)","journal-title":"Math. Program."},{"key":"9148_CR3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K.D. Boese","year":"1994","unstructured":"Boese, K.D., Khang, A., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 16, 101\u2013113 (1994)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9148_CR4","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1109\/TWC.2004.827767","volume":"3","author":"I. Demirkol","year":"2004","unstructured":"Demirkol, I., Ersoy, C., Caglayan, M.U., Delic, H.: Location area planning and cell-to-switch assignment in cellular networks. IEEE Trans. Wirel. Commun. 3(3), 880\u2013890 (2004)","journal-title":"IEEE Trans. Wirel. Commun."},{"issue":"5","key":"9148_CR5","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"W.E. Donath","year":"1973","unstructured":"Donath, W.E., Hoffman, A.J.: Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 17(5), 420\u2013425 (1973)","journal-title":"IBM J. Res. Dev."},{"issue":"10","key":"9148_CR6","doi-asserted-by":"crossref","first-page":"1634","DOI":"10.1287\/mnsc.1060.0578","volume":"52","author":"A. Ernst","year":"2006","unstructured":"Ernst, A., Jiang, H., Krishnamoorthy, M.: Exact solutions to task allocation problems. Manag. Sci. 52(10), 1634\u20131646 (2006)","journal-title":"Manag. Sci."},{"issue":"2","key":"9148_CR7","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01581107","volume":"81","author":"C.E. Ferreira","year":"1998","unstructured":"Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: The node capacitated graph partitioning problem: a computational study. Math. Program. 81(2), 229\u2013256 (1998)","journal-title":"Math. Program."},{"key":"9148_CR8","first-page":"175","volume-title":"Proc. 19th ACM\/IEEE Design Automation Conference","author":"C. Fiduccia","year":"1982","unstructured":"Fiduccia, C., Mattheyses, R.: A linear time heuristic for improving network partitions. In: Proc. 19th ACM\/IEEE Design Automation Conference, pp. 175\u2013181 (1982)"},{"key":"9148_CR9","first-page":"1835","volume-title":"Proc. 46th IEEE Vehicular Technology Conference","author":"P. Gondim","year":"1996","unstructured":"Gondim, P.: Genetic algorithms and location area partitioning problem in cellular networks. In: Proc. 46th IEEE Vehicular Technology Conference, pp. 1835\u20131838 (1996)"},{"issue":"1\/2","key":"9148_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1147\/rd.411.0171","volume":"41","author":"A. Gupta","year":"1997","unstructured":"Gupta, A.: Fast and effective algorithms for graph partitioning and sparse matrix ordering. IBM J. Res. Dev. 41(1\/2), 171\u2013184 (1997)","journal-title":"IBM J. Res. Dev."},{"issue":"7","key":"9148_CR11","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1109\/43.644032","volume":"16","author":"L. Hagen","year":"1997","unstructured":"Hagen, L., Kahng, A.: Combining problem reduction and adaptive multi-start: a new technique for superior iterative partitioning. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 16(7), 709\u2013717 (1997)","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"key":"9148_CR12","volume-title":"Proc. 1995 ACM\/IEEE Conference on Supercomputing","author":"B. Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proc. 1995 ACM\/IEEE Conference on Supercomputing. ACM, New York (1995)"},{"issue":"1","key":"9148_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20(1), 359\u2013392 (1998a)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"9148_CR14","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","volume":"48","author":"G. Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distrib. Comput. 48(1), 96\u2013129 (1998b)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9148_CR15","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"9148_CR16","first-page":"71","volume-title":"Proc. INFOCOM\u201999","author":"R. Krishnan","year":"1999","unstructured":"Krishnan, R., Ramanathan, R., Steentrup, M.: Optimization algorithms for large self-structuring networks. In: Proc. INFOCOM\u201999, vol. 1, pp. 71\u201378 (1999)"},{"key":"9148_CR17","volume-title":"Radio Network Planning and Optimisation for UMTS","author":"J. Laiho","year":"2002","unstructured":"Laiho, J., Wacker, A., Novosad, T.: Radio Network Planning and Optimisation for UMTS. Wiley, New York (2002)"},{"issue":"1","key":"9148_CR18","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","volume":"95","author":"A. Lisser","year":"2003","unstructured":"Lisser, A., Rendl, F.: Graph partitioning using linear and semidefinite programming. Math. Program. 95(1), 91\u2013101 (2003)","journal-title":"Math. Program."},{"issue":"6","key":"9148_CR19","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1057\/palgrave.jors.2602413","volume":"59","author":"A. Lusa","year":"2008","unstructured":"Lusa, A., Potts, C.: A variable neighbourhood search algorithm for the constrained task allocation problem. J. Oper. Res. Soc. 59(6), 812\u2013822 (2008)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"9148_CR20","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1109\/90.469954","volume":"3","author":"A. Merchant","year":"1995","unstructured":"Merchant, A., Sengupta, B.: Assignment of cells to switches in PCS networks. IEEE\/ACM Trans. Netw. 3(5), 521\u2013526 (1995)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9148_CR21","volume-title":"Advanced Cellular Network Planning and Optimisation","author":"AR Mishra","year":"2007","unstructured":"Mishra, AR: Advanced Cellular Network Planning and Optimisation. Wiley, New York (2007)"},{"key":"9148_CR22","series-title":"Cell & Sys","volume-title":"The GSM System for Mobile Communications","author":"M. Mouly","year":"1992","unstructured":"Mouly, M., Pautet, M.B.: The GSM System for Mobile Communications. Cell & Sys. Telecom Publishing, Palaiseau (1992)"},{"issue":"5","key":"9148_CR23","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/S0140-3664(01)00371-1","volume":"25","author":"S. Pierre","year":"2002","unstructured":"Pierre, S., Houeto, F.: A tabu-search approach for assigning cells to switches in cellular mobile networks. Comput. Commun. 25(5), 465\u2013478 (2002)","journal-title":"Comput. Commun."},{"key":"9148_CR24","first-page":"871","volume-title":"Proc. 45th IEEE Vehicular Technology Conference","author":"J. Plehn","year":"1995","unstructured":"Plehn, J.: The design of location areas in a GSM-network. In: Proc. 45th IEEE Vehicular Technology Conference, pp. 871\u2013875 (1995)"},{"key":"9148_CR25","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF02125455","volume":"63","author":"E. Rolland","year":"1996","unstructured":"Rolland, E., Pirkul, H., Glover, F.: Tabu search for graph partitioning. Ann. Oper. Res. 63, 209\u2013232 (1996)","journal-title":"Ann. Oper. Res."},{"key":"9148_CR26","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1008850615965","volume":"12","author":"D. Saha","year":"2000","unstructured":"Saha, D., Mukherjee, A., Bhattacharjee, P.S.: A simple heuristic for assignment of cells to switches in a PCS network. Wirel. Pers. Commun. 12, 209\u2013224 (2000)","journal-title":"Wirel. Pers. Commun."},{"key":"9148_CR27","volume-title":"CRPC Parallel Computing Handbook","author":"K. Schloegel","year":"2000","unstructured":"Schloegel, K., Karypis, G., Kumar, V.: Graph partitioning for high performance scientific simulations. In: Dongarra, J., Foster, I., Fox, G., Kennedy, K., White, A. (eds.) CRPC Parallel Computing Handbook. Morgan Kaufmann, San Mateo (2000)"},{"issue":"10","key":"9148_CR28","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"H.D. Sherali","year":"2001","unstructured":"Sherali, H.D., Smith, J.C.: Improving discrete model representations via symmetry considerations. Manag. Sci. 47(10), 1396\u20131407 (2001)","journal-title":"Manag. Sci."},{"key":"9148_CR29","unstructured":"Toril, M.: Self-tuning algorithms for the assignment of packet control units and handover parameters in GERAN. Ph.D. thesis, University of M\u00e1laga (2007)"},{"issue":"3","key":"9148_CR30","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1109\/LCOMM.2006.1603390","volume":"10","author":"M. Toril","year":"2006","unstructured":"Toril, M., Wille, V., Barco, R.: Optimization of the assignment of cells to packet control units in GERAN. IEEE Commun. Lett. 10(3), 219\u2013221 (2006)","journal-title":"IEEE Commun. Lett."},{"key":"9148_CR31","unstructured":"Toril, M., Wille, V., Molina-Fern\u00e1ndez, I., Walshaw, C.: An adaptive multi-start graph partitioning algorithm for structuring cellular networks. Tech. Rep. IC-10-01, University of M\u00e1laga (2010). http:\/\/mobilenet.ic.uma.es\/images\/stories\/Publications\/IC-10-01.pdf"},{"key":"9148_CR32","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/B:ANOR.0000039525.80601.15","volume":"131","author":"C. Walshaw","year":"2004","unstructured":"Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Ann. Oper. Res. 131, 325\u2013372 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9148_CR33","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1137\/S1064827598337373","volume":"22","author":"C. Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M.: Mesh partitioning: a multilevel balancing and refinement algorithm. SIAM J. Sci. Comput. 22(1), 63\u201380 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"9148_CR34","unstructured":"Walshaw, C., Everett, M.G.: Multilevel landscapes in combinatorial optimisation. Tech. Rep. 02\/IM\/93 (2002)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9148-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9148-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9148-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:31Z","timestamp":1559242471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9148-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,30]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["9148"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9148-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,30]]}}}