{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T16:30:16Z","timestamp":1772555416560,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642291234","type":"print"},{"value":"9783642291241","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29124-1_15","type":"book-chapter","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T17:24:42Z","timestamp":1332523482000},"page":"172-181","source":"Crossref","is-referenced-by-count":8,"title":["Iterated Greedy Algorithms for the Maximal Covering Location Problem"],"prefix":"10.1007","author":[{"given":"Francisco J.","family":"Rodriguez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Blum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Garc\u00eda-Mart\u00ednez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"IBM ILOG CPLEX optimizer (November 2011), http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"15_CR2","unstructured":"Arakaki, R.G.I., Lorena, L.A.N.: A constructive genetic algorithm for the maximal covering location problem. In: Proceedings of the 4th Metaheuristics International Conference (MIC 2001), pp. 13\u201317 (2001)"},{"issue":"6","key":"15_CR3","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C. Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing\u00a011(6), 4135\u20134151 (2011)","journal-title":"Applied Soft Computing"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1111\/j.1435-5597.1974.tb00902.x","volume":"32","author":"R. Church","year":"1974","unstructured":"Church, R., Velle, C.R.: The maximal covering location problem. Papers in Regional Science\u00a032(1), 101\u2013118 (1974)","journal-title":"Papers in Regional Science"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Culberson, J.C., Luo, F.: Exploring the k-colorable landscape with iterated greedy. Dimacs Series in Discrete Mathematics and Theoretical Computer Science, pp. 245\u2013284. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026\/13"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0377-2217(99)00171-X","volume":"124","author":"R.D. Galvao","year":"2000","unstructured":"Galvao, R.D., Espejo, L.G.A., Boffey, B.: A comparison of lagrangean and surrogate relaxations for the maximal covering location problem. European Journal of Operational Research\u00a0124(2), 377\u2013389 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/0377-2217(94)00159-6","volume":"88","author":"R.D. Galvao","year":"1996","unstructured":"Galvao, R.D., ReVelle, C.: A lagrangean heuristic for the maximal covering location problem. European Journal of Operational Research\u00a088(1), 114\u2013123 (1996)","journal-title":"European Journal of Operational Research"},{"key":"15_CR8","first-page":"57","volume":"9","author":"L.A. Lorena","year":"2001","unstructured":"Lorena, L.A., Pereira, M.A.: A lagrangean\/surrogate heuristic for the maximal covering location problem using hillsman\u2019s edition. International Journal of Industrial Engineering\u00a09, 57\u201367 (2001)","journal-title":"International Journal of Industrial Engineering"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1137\/0604028","volume":"4","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N., Zemel, E., Hakimi, S.L.: The maximum coverage location problem. SIAM Journal on Algebraic and Discrete Methods\u00a04(2), 253\u2013261 (1983)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"15_CR10","volume-title":"The traveling salesman: computational solutions for TSP applications","author":"G. Reinelt","year":"1994","unstructured":"Reinelt, G.: The traveling salesman: computational solutions for TSP applications. Springer, Heidelberg (1994)"},{"issue":"3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R. Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research\u00a0177(3), 2033\u20132049 (2007)","journal-title":"European Journal of Operational Research"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. In: Maher, M., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Senne, E.L.F., Pereira, M.A., Lorena, L.A.N.: A decomposition heuristic for the maximal covering location problem. Advances in Operations Research\u00a02010 (2010)","DOI":"10.1155\/2010\/120756"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Xia, L., Xie, M., Xu, W., Shao, J., Yin, W., Dong, J.: An empirical comparison of five efficient heuristics for maximal covering location problems. In: IEEE\/INFORMS International Conference on Service Operations, Logistics and Informatics (SOLI 2009), pp. 747\u2013753 (2009)","DOI":"10.1109\/SOLI.2009.5204032"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29124-1_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T21:43:37Z","timestamp":1742766217000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29124-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291234","9783642291241"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29124-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}