{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T07:56:42Z","timestamp":1768982202800,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540285359","type":"print"},{"value":"9783540318989","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11546245_11","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T15:12:11Z","timestamp":1279811531000},"page":"116-127","source":"Crossref","is-referenced-by-count":19,"title":["A Hybrid GRASP with Data Mining for the Maximum Diversity Problem"],"prefix":"10.1007","author":[{"given":"L. F.","family":"Santos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. H.","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Plastino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. L.","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","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":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/11427186_48","volume-title":"Experimental and Efficient Algorithms","author":"M.R.Q. Andrade","year":"2005","unstructured":"Andrade, M.R.Q., Andrade, P.M.F., Martins, S.L., Plastino, A.: GRASP with path-relinking for the maximum diversity problem. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 558\u2013569. Springer, Heidelberg (2005)"},{"key":"11_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. Journal of Global Optimization\u00a06, 109\u2013133 (1995)","journal-title":"Journal of Global Optimization"},{"key":"11_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":"11_CR5","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":"11_CR6","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":"11_CR7","doi-asserted-by":"crossref","unstructured":"Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations: Introduction to FIMI 2003. In: IEEE ICDM FIMI Workshop (2003)","DOI":"10.1145\/1007730.1007744"},{"key":"11_CR8","unstructured":"Grahne, G., Zhu, J.: Efficiently using prefix-trees in mining frequent itemsets. In: IEEE ICDM FIMI Workshop (2003)"},{"key":"11_CR9","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2000","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishing, San Francisco (2000)"},{"key":"11_CR10","unstructured":"Kochenberger, G., Glover, F.: Diversity data mining, Working Paper. The University of Mississipi (1999)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Orlando, S., Palmerimi, P., Perego, R.: Adaptive and resource-aware mining of frequent sets. In: IEEE Intl. Conf. on Data Mining, pp. 338\u2013345 (2002)","DOI":"10.1109\/ICDM.2002.1183921"},{"key":"11_CR12","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 application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing\u00a012, 164\u2013176 (2000)","journal-title":"INFORMS Journal on Computing"},{"key":"11_CR13","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. 219\u2013249 (2003)","DOI":"10.1007\/0-306-48056-5_8"},{"key":"11_CR14","unstructured":"Ribeiro, M.H., Trindade, V., Plastino, A., Martins, S.: Hybridization of GRASP metaheuristic with data mining techniques. In: Workshop on Hybrid Metaheuristics in conjunction with the 16th European Conf. on Artificial Intelligence, pp. 69\u201378 (2004)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","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. LNCS, vol.\u00a03059, pp. 498\u2013512. Springer, Heidelberg (2004)"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E.G. Talbi","year":"2002","unstructured":"Talbi, E.G.: A taxonomy of hybrid metaheuristics. Journal of Heuristics\u00a08, 541\u2013564 (2002)","journal-title":"Journal of Heuristics"},{"key":"11_CR17","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","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11546245_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:39:49Z","timestamp":1605623989000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11546245_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540285359","9783540318989"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11546245_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}