{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T12:22:06Z","timestamp":1768998126767,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,4,12]],"date-time":"2007-04-12T00:00:00Z","timestamp":1176336000000},"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":[[2007,8]]},"DOI":"10.1007\/s10732-007-9010-x","type":"journal-article","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T18:02:32Z","timestamp":1176919352000},"page":"315-336","source":"Crossref","is-referenced-by-count":30,"title":["New heuristics for the maximum diversity problem"],"prefix":"10.1007","volume":"13","author":[{"given":"Geiza C.","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos R. Q.","family":"de Andrade","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz S.","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone L.","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandre","family":"Plastino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,4,12]]},"reference":[{"key":"9010_CR1","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R.M. Aiex","year":"2002","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: An experimental investigation. J. Heuristics 8, 343\u2013373 (2002)","journal-title":"J. Heuristics"},{"key":"9010_CR2","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"9010_CR3","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860\u2013878 (1994)","journal-title":"Oper. Res."},{"key":"9010_CR4","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, 175\u2013181 (1996)","journal-title":"Oper. Res. Lett."},{"key":"9010_CR5","first-page":"653","volume":"19","author":"F. Glover","year":"1977","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of scatter search and path-relinking. Control Cybern. 19, 653\u2013684 (1977)","journal-title":"Control Cybern."},{"key":"9010_CR6","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1111\/j.1540-5915.1993.tb00509.x","volume":"24","author":"F. Glover","year":"1993","unstructured":"Glover, F., Kuo, C., Dhir, K.: Analyzing and modeling the maximum diversity problem by zero\u2013one programming. Decis. Sci. 24, 1171\u20131185 (1993)","journal-title":"Decis. Sci."},{"key":"9010_CR7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1504\/JBM.1997.141033","volume":"4","author":"F. Glover","year":"1996","unstructured":"Glover, F., Kuo, C.-C., Dhir, K.S.: Integer programming and heuristic approaches to the minimum diversity problem. J. Bus. Manag. 4, 93\u2013111 (1996)","journal-title":"J. Bus. Manag."},{"key":"9010_CR8","unstructured":"Kochenberger, G., Glover, F.: Diversity data mining. Working Paper, The University of Mississippi, 1999"},{"key":"9010_CR9","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":"9010_CR10","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1287\/ijoc.12.3.164.12639","volume":"12","author":"M. Prais","year":"2000","unstructured":"Prais, M., Ribeiro, C.C.: Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. Comput. 12, 164\u2013176 (2000)","journal-title":"INFORMS J. Comput."},{"key":"9010_CR11","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C., Ribeiro, C.C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp.\u00a0219\u2013249 (2003)","DOI":"10.1007\/0-306-48056-5_8"},{"key":"9010_CR12","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T. et\u00a0al. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp.\u00a029\u201363 (2005)","DOI":"10.1007\/0-387-25383-1_2"},{"key":"9010_CR13","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, 228\u2013246 (2002)","journal-title":"INFORMS J. Comput."},{"key":"9010_CR14","series-title":"Lecture Notes on Computer Science","volume-title":"Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem","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: Lecture Notes on Computer Science, vol.\u00a03059, pp.\u00a0498\u2013512. Springer, Berlin (2004)"},{"key":"9010_CR15","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1057\/palgrave.jors.2600510","volume":"49","author":"R. Weitz","year":"1998","unstructured":"Weitz, R., Lakshminarayanan, S.: An empirical comparison of heuristic methods for creating maximally diverse groups. J. Oper. Res. Soc. 49, 635\u2013646 (1998)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9010-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-007-9010-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-007-9010-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T20:52:24Z","timestamp":1736974344000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-007-9010-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,12]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,8]]}},"alternative-id":["9010"],"URL":"https:\/\/doi.org\/10.1007\/s10732-007-9010-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,12]]}}}