{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:15:12Z","timestamp":1778127312049,"version":"3.51.4"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,3]],"date-time":"2011-06-03T00:00:00Z","timestamp":1307059200000},"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":[[2013,8]]},"DOI":"10.1007\/s10732-011-9172-4","type":"journal-article","created":{"date-parts":[[2011,6,3]],"date-time":"2011-06-03T03:02:22Z","timestamp":1307070142000},"page":"591-615","source":"Crossref","is-referenced-by-count":77,"title":["Heuristics and metaheuristics for the maximum diversity problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Rafael","family":"Mart\u00ed","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micael","family":"Gallego","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham","family":"Duarte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eduardo G.","family":"Pardo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,3]]},"reference":[{"key":"9172_CR1","unstructured":"Aringhieri, R., Cordone, R.: Better and faster solutions for the maximum diversity problem. Technical report, Universit\u00e9 degli Studi di Milano, Polo Didattico e di Ricerca di Crema (2006)"},{"key":"9172_CR2","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1057\/jors.2010.104","volume":"62","author":"R. Aringhieri","year":"2011","unstructured":"Aringhieri, R., Cordone, R.: Comparing local search metaheuristics for the maximum diversity problem. J. Oper. Res. Soc. 62, 266\u2013280 (2011)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9172_CR3","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10288-007-0033-9","volume":"6","author":"R. Aringhieri","year":"2008","unstructured":"Aringhieri, R., Cordone, R., Melzani, Y.: Tabu search vs. grasp for the maximum diversity problem. 4OR 6(1), 45\u201360 (2008)","journal-title":"4OR"},{"issue":"11","key":"9172_CR4","doi-asserted-by":"crossref","first-page":"2885","DOI":"10.1016\/j.cor.2008.12.020","volume":"36","author":"J. Brimberg","year":"2009","unstructured":"Brimberg, J., Mladenovic, N., Urosevic, D., Ngai, E.: Variable neighborhood search for the heaviest k-subgraph. Comput. Oper. Res. 36(11), 2885\u20132891 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9172_CR5","unstructured":"Cappanera, P.: A survey on obnoxious facility location problems. Technical Report TR-99-11, Dipartimento di Elettronica ed Informazione, Politecnico di Milano, 19 (1999)"},{"issue":"2","key":"9172_CR6","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1006\/jagm.2000.1145","volume":"38","author":"B. Chandra","year":"2001","unstructured":"Chandra, B., Halldorsson, M.M.: Approximation algorithms for dispersion problems. J. Algorithms 38(2), 438\u2013465 (2001)","journal-title":"J. Algorithms"},{"key":"9172_CR7","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.ejor.2006.01.021","volume":"178","author":"A. Duarte","year":"2007","unstructured":"Duarte, A., Mart\u00ed, R.: Tabu search and grasp for the maximum diversity problem. Eur. J. Oper. Res. 178, 71\u201384 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9172_CR8","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E. Erkut","year":"1990","unstructured":"Erkut, E.: The discrete p-dispersion problem. Eur. J. Oper. Res. 46(1), 48\u201360 (1990)","journal-title":"Eur. J. Oper. Res."},{"key":"9172_CR9","first-page":"68","volume":"29","author":"E. Erkut","year":"1991","unstructured":"Erkut, E., Neuman, S.: Comparison of four models for dispersing facilities. INFOR Can. J. Oper. Res. Inf. Process. 29, 68\u201386 (1991)","journal-title":"INFOR Can. J. Oper. Res. Inf. Process."},{"key":"9172_CR10","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/s004530010050","volume":"29","author":"U. Feige","year":"2001","unstructured":"Feige, U., Kortsarz, G., Peleg, D.: The dense k-subgraph problem. Algorithmica 29, 410\u2013421 (2001)","journal-title":"Algorithmica"},{"key":"9172_CR11","first-page":"1","volume":"2","author":"T. Feo","year":"1995","unstructured":"Feo, T., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 2, 1\u201327 (1995)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9172_CR12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/s10589-007-9161-6","volume":"44","author":"M. Gallego","year":"2009","unstructured":"Gallego, M., Duarte, A., Laguna, M., Mart\u00ed, R.: Hybrid heuristics for the maximum diversity problem. Comput. Optim. Appl. 44(3), 411\u2013426 (2009)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9172_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0167-6377(96)00025-9","volume":"19","author":"J.B. Ghosh","year":"1996","unstructured":"Ghosh, J.B.: Computational aspects of the maximum diversity problem. Oper. Res. Lett. 19(1), 175\u2013181 (1996)","journal-title":"Oper. Res. Lett."},{"key":"9172_CR14","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F. Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"key":"9172_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)"},{"issue":"1","key":"9172_CR16","first-page":"109","volume":"19","author":"F. Glover","year":"1998","unstructured":"Glover, F., Kuo, C.C., Dhir, K.S.: Heuristic algorithms for the maximum diversity problem. J. Inf. Optim. Sci. 19(1), 109\u2013132 (1998)","journal-title":"J. Inf. Optim. Sci."},{"key":"9172_CR17","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2000","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Mateo (2000)"},{"key":"9172_CR18","volume-title":"Handbook of Metaheuristics","author":"P. Hansen","year":"2003","unstructured":"Hansen, P., Mladenovic, N.: Handbook of Metaheuristics. Springer, Berlin (2003). Chap. Variable neighborhood search, pp.\u00a0145\u2013184"},{"key":"9172_CR19","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-32363-5_2","volume-title":"Recent Advances in Memetic Algorithms","author":"K. Katayama","year":"2005","unstructured":"Katayama, K., Narihisa, H.: An evolutionary approach for the maximum diversity problem. In: Hart, W., Krasnogor, N., Smith, J.E. (eds.) Recent Advances in Memetic Algorithms, vol. 166, pp. 31\u201347. Springer, Berlin (2005)"},{"key":"9172_CR20","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) 1970","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"9172_CR21","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02060482","volume":"40","author":"R.K. Kincaid","year":"1992","unstructured":"Kincaid, R.K.: Good solutions to discrete noxious location problems via metaheur\u00edsticas. Ann. Oper. Res. 40(1), 265\u2013281 (1992)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9172_CR22","first-page":"171","volume":"1","author":"R.K. Kincaid","year":"1993","unstructured":"Kincaid, R.K., Yellin, L.G.: The discrete p-dispersion-sum problem: Results on trees and graphs. Comput. Oper. Res. 1(2), 171\u2013186 (1993)","journal-title":"Comput. Oper. Res."},{"issue":"4598","key":"9172_CR23","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"4","key":"9172_CR24","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1111\/j.1538-4632.1987.tb00133.x","volume":"19","author":"M.J. Kuby","year":"1987","unstructured":"Kuby, M.J.: Programming models for facility dispersion: The p-dispersion and maximum dispersion problem. Geogr. Anal. 19(4), 315\u2013329 (1987)","journal-title":"Geogr. Anal."},{"issue":"6","key":"9172_CR25","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1111\/j.1540-5915.1993.tb00509.x","volume":"24","author":"C.C. Kuo","year":"1993","unstructured":"Kuo, C.C., Glover, F., Dhir, K.S.: Analyzing and modeling the maximum diversity problem by zero-one programming. Decis. Sci. 24(6), 1171\u20131185 (1993)","journal-title":"Decis. Sci."},{"key":"9172_CR26","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1287\/ijoc.11.1.44","volume":"11","author":"M. Laguna","year":"1999","unstructured":"Laguna, M., Mart\u00ed, R.: Grasp and path relinking for 2-layer straight line crossing minimization. INFORMS J. Comput. 11, 44\u201352 (1999)","journal-title":"INFORMS J. Comput."},{"key":"9172_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","volume-title":"Scatter Search Methodology and Implementations in C","author":"M. Laguna","year":"2003","unstructured":"Laguna, M., Marti, R.: Scatter Search Methodology and Implementations in C. Kluwer Academic, Dordrecht (2003)"},{"key":"9172_CR28","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1023\/A:1021525624027","volume":"177","author":"E.M. Macambira","year":"2002","unstructured":"Macambira, E.M.: An application of tabu search heuristic for the maximum edge-weighted subgraph problem. Ann. Oper. Res. 177, 175\u2013190 (2002)","journal-title":"Ann. Oper. Res."},{"key":"9172_CR29","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/S0377-2217(99)00262-3","volume":"123","author":"E.M. Macambira","year":"2000","unstructured":"Macambira, E.M., de Souza, C.C.: The edge-weighted clique problem: valid inequalities, facets and polyhedral computations. Eur. J. Oper. Res. 123, 346\u2013371 (2000)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9172_CR30","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","volume":"200","author":"R. Mart\u00ed","year":"2010","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A.: A branch and bound algorithm for the maximum diversity problem. Eur. J. Oper. Res. 200(1), 36\u201344 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"9172_CR31","first-page":"89","volume":"117","author":"S. McConnell","year":"1988","unstructured":"McConnell, S.: The new battle over immigration. Fortune 117(10), 89\u2013102 (1988)","journal-title":"Fortune"},{"issue":"3","key":"9172_CR32","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1287\/mnsc.30.3.290","volume":"30","author":"I.D. Moon","year":"1984","unstructured":"Moon, I.D., Chaudhry, S.S.: An analysis of network location problems with distance constraints. Manag. Sci. 30(3), 290\u2013307 (1984)","journal-title":"Manag. Sci."},{"key":"9172_CR33","first-page":"219","volume-title":"New Ideas in Optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P.: Memetic algorithms: A short introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 219\u2013234. McGraw-Hill, Maidenhead (1999)"},{"key":"9172_CR34","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.amc.2006.11.090","volume":"189","author":"G. Palubeckis","year":"2007","unstructured":"Palubeckis, G.: Iterated tabu search for the maximum diversity problem. Appl. Math. Comput. 189, 371\u2013383 (2007)","journal-title":"Appl. Math. Comput."},{"issue":"6","key":"9172_CR35","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1016\/0016-3287(87)90088-7","volume":"19","author":"D. Pearce","year":"1987","unstructured":"Pearce, D.: Economics and genetic diversity. Future 19(6), 710\u2013712 (1987)","journal-title":"Future"},{"issue":"5","key":"9172_CR36","doi-asserted-by":"crossref","first-page":"1380","DOI":"10.1016\/j.cor.2004.09.033","volume":"33","author":"D. Pisinger","year":"2006","unstructured":"Pisinger, D.: Upper bounds and exact algorithms for p-dispersion problems. Comput. Oper. Res. 33(5), 1380\u20131398 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9172_CR37","unstructured":"Porter, W.M., Rawal, K.M., Rachie, K.O., Wien, H.C., Williams, R.C.: Cowpea germplasm catalog No\u00a01. International Institute of Tropical Agriculture, Ibadan, Nigeria (1975)"},{"issue":"1","key":"9172_CR38","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ejor.2008.06.005","volume":"197","author":"O.A. Prokopyev","year":"2009","unstructured":"Prokopyev, O.A., Kong, N., Martinez-Torres, D.L.: The equitable dispersion problem. Eur. J. Oper. Res. 197(1), 59\u201367 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9172_CR39","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1287\/opre.42.2.299","volume":"42","author":"S.S. Ravi","year":"1994","unstructured":"Ravi, S.S., Rosenkrantz, D.J., Tayi, G.K.: Heuristic and special case algorithms for dispersion problems. Oper. Res. 42(2), 299\u2013310 (1994)","journal-title":"Oper. Res."},{"issue":"3","key":"9172_CR40","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid grasp with perturbations for the steiner problem in graphs. INFORMS J. Comput. 14(3), 228\u2013246 (2002)","journal-title":"INFORMS J. Comput."},{"key":"9172_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/11546245_11","volume-title":"Hybrid Metaheuristics","author":"L.F. Santos","year":"2005","unstructured":"Santos, L.F., Ribeiro, M.H., Plastino, A., Martins, S.L.: A hybrid grasp with data mining for the maximum diversity problem. In: Blesa, M.J., Blum, C., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics. Lecture Notes in Computer Science, vol. 3636, pp. 116\u2013127. Springer, Berlin (2005)"},{"key":"9172_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/978-3-540-24838-5_37","volume-title":"Experimental and Efficient Algorithms","author":"G.C. Silva","year":"2004","unstructured":"Silva, G.C., Ochi, L.S., Martins, S.L.: Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. In: Experimental and Efficient Algorithms. Lecture Notes in Computer Science, vol. 3059, pp. 498\u2013512. Springer, Berlin (2004)"},{"issue":"4","key":"9172_CR43","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10732-007-9010-x","volume":"13","author":"G.C. Silva","year":"2007","unstructured":"Silva, G.C., Andrade, M.R.Q., Ochi, L.S., Martins, S.L., Plastino, A.: New heuristics for the maximum diversity problem. J. Heuristics 13(4), 315\u2013336 (2007)","journal-title":"J. Heuristics"},{"issue":"1","key":"9172_CR44","first-page":"31","volume":"52","author":"R.P. Swierenga","year":"1977","unstructured":"Swierenga, R.P.: Ethnicity in historical perspective. Soc. Sci. 52(1), 31\u201344 (1977)","journal-title":"Soc. Sci."},{"issue":"4","key":"9172_CR45","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1109\/TSMCB.2008.2010220","volume":"39","author":"J. Wang","year":"2009","unstructured":"Wang, J., Zhou, Y., Yin, J., Zhang, Y.: Competitive hopfield network combined with estimation of distribution for maximum diversity problems. IEEE Trans. Syst. Man Cybern., Part B, Cybern. 39(4), 1048\u20131066 (2009). Special Issue on Cybernetics and Cognitive Informatics","journal-title":"IEEE Trans. Syst. Man Cybern., Part B, Cybern."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9172-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9172-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9172-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:32Z","timestamp":1559242472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9172-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,3]]},"references-count":45,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9172"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9172-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,3]]}}}