{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:28Z","timestamp":1725559468827},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_48","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"558-569","source":"Crossref","is-referenced-by-count":9,"title":["GRASP with Path-Relinking for the Maximum Diversity Problem"],"prefix":"10.1007","author":[{"given":"Marcos R. Q.","family":"de Andrade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paulo M. F.","family":"de Andrade","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","reference":[{"key":"48_CR1","doi-asserted-by":"publisher","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. of Heuristics\u00a08, 343\u2013373 (2002)","journal-title":"J. of Heuristics"},{"key":"48_CR2","unstructured":"Andrade, P.M.F., Plastino, A., Ochi, L.S., Martins, S.L.: GRASP for the Maximum Diversity Problem. In: Procs. of MIC 2003. CD-ROM Paper: MIC03_15 (2003)"},{"key":"48_CR3","doi-asserted-by":"publisher","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. of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"J. of Global Optimization"},{"key":"48_CR4","doi-asserted-by":"publisher","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. Operations Research Letters\u00a019, 175\u2013181 (1996)","journal-title":"Operations Research Letters"},{"key":"48_CR5","first-page":"653","volume":"19","author":"F. Glover","year":"1977","unstructured":"Glover, F., Laguna, M., Marti, R.: Fundamentals of scatter search and path-relinking. Control and Cybernetics\u00a019, 653\u2013684 (1977)","journal-title":"Control and Cybernetics"},{"key":"48_CR6","unstructured":"Glover, F., Hersh, G., McMillan, C.: Selecting subsets of maximum diversity, MS\/IS Report No. 77-9, University of Colorado at Boulder (1977)"},{"key":"48_CR7","first-page":"93","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. of Bus. and Management\u00a04, 93\u2013111 (1996)","journal-title":"J. of Bus. and Management"},{"key":"48_CR8","unstructured":"Kochenberger, G., Glover, F.: Diversity data mining. Working Paper. The University of Mississipi (1999)"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C., Ribeiro, C.C.: GRASP with path-relinking: Recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, pp. 29\u201363 (2005)","DOI":"10.1007\/0-387-25383-1_2"},{"key":"48_CR10","doi-asserted-by":"publisher","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. on Computing\u00a014, 228\u2013246 (2002)","journal-title":"INFORMS J. on Computing"},{"key":"48_CR11","doi-asserted-by":"publisher","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: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004, vol.\u00a03059, pp. 498\u2013512. Springer, Heidelberg (2004)"},{"key":"48_CR12","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. of the Op. Res. Soc.\u00a049, 635\u2013646 (1998)","journal-title":"J. of the Op. Res. Soc."}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T01:27:53Z","timestamp":1559266073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11427186_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}