{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T09:22:22Z","timestamp":1742635342615},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220671"},{"type":"electronic","value":"9783540248385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24838-5_37","type":"book-chapter","created":{"date-parts":[[2010,8,8]],"date-time":"2010-08-08T21:34:14Z","timestamp":1281303254000},"page":"498-512","source":"Crossref","is-referenced-by-count":29,"title":["Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem"],"prefix":"10.1007","author":[{"given":"Geiza C.","family":"Silva","sequence":"first","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"}]}],"member":"297","reference":[{"key":"37_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 distribuition of solution time in GRASP: an experimental investigation. Journal of Heuristics\u00a08, 343\u2013373 (2002)","journal-title":"Journal of Heuristics"},{"key":"37_CR2","unstructured":"Andrade, P.M.F., Plastino, A., Ochi, L.S., Martins, S.L.: GRASP for the Maximum Diversity Problem. In: Proceedings of MIC 2003 (2003)"},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0305-0483(99)00037-7","volume":"28","author":"J. Bhadury","year":"2000","unstructured":"Bhadury, J., Joy Mighty, E., Damar, H.: Maximing workforce diversity in project teams: a network flow approach. Omega\u00a028, 143\u2013153 (2000)","journal-title":"Omega"},{"key":"37_CR4","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. Journal of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"key":"37_CR5","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 maximum diversity problem. Operations Research Letters\u00a019, 175\u2013181 (1996)","journal-title":"Operations Research Letters"},{"key":"37_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)"},{"issue":"1","key":"37_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. Journal of Business and Management\u00a04(1), 93\u2013111 (1996)","journal-title":"Journal of Business and Management"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N.: An introduction to variable neighborhood search, Metaheuristics. In: Voss, S., et al. (eds.) Advances and Trends in Local Search, Paradigms for Optimization, pp. 433\u2013458 (1999)","DOI":"10.1007\/978-1-4615-5775-3_30"},{"key":"37_CR9","unstructured":"Katayama, K., Naribisa, H.: An evolutionary approach for the maximum diversity problem, Working Paper, Department of Information and Computer Engineering, Okayama University of Science (2003)"},{"key":"37_CR10","unstructured":"Kochenberger, G., Glover, F.: Diversity data mining, Working Paper, The University of Mississipi (1999)"},{"key":"37_CR11","doi-asserted-by":"publisher","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 aplication to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing\u00a012, 164\u2013176 (2000)","journal-title":"INFORMS Journal on Computing"},{"key":"37_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 group. Journal of the operational Research Society\u00a049, 635\u2013646 (1998)","journal-title":"Journal of the operational Research Society"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24838-5_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:56:54Z","timestamp":1605761814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24838-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220671","9783540248385"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24838-5_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}