{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T23:09:02Z","timestamp":1777072142646,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,5,15]],"date-time":"2011-05-15T00:00:00Z","timestamp":1305417600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10479-011-0898-z","type":"journal-article","created":{"date-parts":[[2011,5,14]],"date-time":"2011-05-14T02:50:29Z","timestamp":1305341429000},"page":"275-293","source":"Crossref","is-referenced-by-count":40,"title":["A simple and effective algorithm for the MaxMin diversity problem"],"prefix":"10.1007","volume":"186","author":[{"given":"Daniel Cosmin","family":"Porumbel","sequence":"first","affiliation":[]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,15]]},"reference":[{"key":"898_CR1","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1007\/11427186_48","volume-title":"GRASP with path-relinking for the maximum diversity problem","author":"M. Andrade","year":"2005","unstructured":"Andrade, M., Andrade, P., Martins, S., & Plastino, A. (2005). Lecture notes in computer science: Vol. 3503. GRASP with path-relinking for the maximum diversity problem (pp. 558\u2013569)."},{"key":"898_CR2","first-page":"71","volume-title":"Proceedings of the 35th conference on Winter simulation: driving innovation","author":"J. April","year":"2003","unstructured":"April, J., Glover, F., Kelly, J. P., & Laguna, M. (2003). Simulation-based optimization: practical introduction to simulation optimization. In Proceedings of the 35th conference on Winter simulation: driving innovation (pp. 71\u201378)."},{"issue":"2","key":"898_CR3","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. (2011). Comparing local search metaheuristics for the maximum diversity problem. The Journal of the Operational Research Society, 62(2), 266\u2013280.","journal-title":"The Journal of the Operational Research Society"},{"issue":"1","key":"898_CR4","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. (2008). Tabu search versus GRASP for the maximum diversity problem. 4OR: A Quarterly Journal of Operations Research, 6(1), 45\u201360.","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"issue":"8","key":"898_CR5","doi-asserted-by":"crossref","first-page":"2429","DOI":"10.1016\/j.cor.2008.09.007","volume":"36","author":"F. Croce Della","year":"2009","unstructured":"Della Croce, F., Grosso, A., & Locatelli, M. (2009). A heuristic approach for the max-min diversity problem based on max-clique. Computers and Operations Research, 36(8), 2429\u20132433.","journal-title":"Computers and Operations Research"},{"key":"898_CR6","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., & Marti, R. (2007). Tabu search and GRASP for the maximum diversity problem. European Journal of Operational Research, 178, 71\u201384.","journal-title":"European Journal of Operational Research"},{"key":"898_CR7","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. (1990). The discrete dispersion problem. European Journal of Operational Research, 46, 48\u201360.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"898_CR8","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., & Marti, R. (2009). Hybrid heuristics for the maximum diversity problem. Computational Optimization and Applications, 44(3), 411\u2013426.","journal-title":"Computational Optimization and Applications"},{"key":"898_CR9","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. (1996). Computational aspects of the maximum diversity problem. Operations Research Letters, 19, 175\u2013181.","journal-title":"Operations Research Letters"},{"key":"898_CR10","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. (1997). Tabu search. Dordrecht: Kluwer Academic."},{"issue":"1","key":"898_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1080\/02522667.1998.10699366","volume":"19","author":"F. Glover","year":"1998","unstructured":"Glover, F., Kuo, C., & Dhir, K. (1998). Heuristic algorithms for the maximum diversity problem. Journal of Information and Optimization Sciences, 19(1), 109\u2013132.","journal-title":"Journal of Information and Optimization Sciences"},{"issue":"6","key":"898_CR12","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-007-9055-x","volume":"14","author":"A. Grosso","year":"2008","unstructured":"Grosso, A., Locatelli, M., & Pullan, W. (2008). Randomness, plateau search, penalties, restart rules: simple ingredients leading to very efficient heuristics for the maximum clique problem. Journal of Heuristics, 14(6), 587\u2013612.","journal-title":"Journal of Heuristics"},{"key":"898_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02060482","volume":"40","author":"R. Kincaid","year":"1992","unstructured":"Kincaid, R. (1992). Good solutions to discrete noxious location problems via metaheuristics. Annals of Operation Research, 40, 265\u2013281.","journal-title":"Annals of Operation Research"},{"issue":"6","key":"898_CR14","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1111\/j.1540-5915.1993.tb00509.x","volume":"24","author":"C. Kuo","year":"1993","unstructured":"Kuo, C., Glover, F., & Dhir, K. (1993). Analyzing and modeling the maximum diversity problem by zero-one programming. Decision Sciences, 24(6), 1171\u20131185.","journal-title":"Decision Sciences"},{"issue":"1\u20133","key":"898_CR15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P. R. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P. R. (2002). A fast algorithm for the maximum clique problem. Discrete Applied Mathematics, 120(1\u20133), 197\u2013207.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"898_CR16","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. (2007). Iterated tabu search for the maximum diversity problem. Applied Mathematics and Computation, 189(1), 371\u2013383.","journal-title":"Applied Mathematics and Computation"},{"issue":"3","key":"898_CR17","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"M. Resende","year":"2010","unstructured":"Resende, M., Marti, R., Gallego, M., & Duarte, A. (2010). GRASP and path relinking for the max-min diversity problem. Computers and Operations Research, 37(3), 498\u2013408.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"898_CR18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1111\/j.1475-3995.2008.00644.x","volume":"15","author":"L. Santos","year":"2008","unstructured":"Santos, L., Martins, S., & Plastino, A. (2008). Applications of the DM-GRASP heuristic: a survey. International Transactions in Operational Research, 15(4), 387\u2013416.","journal-title":"International Transactions in Operational Research"},{"key":"898_CR19","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 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. (2004). Lecture notes in computer science:\u00a0Vol.\u00a03059. Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem (pp.\u00a0498\u2013512)."},{"issue":"4","key":"898_CR20","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. (2009). Competitive hopfield network combined with estimation of distribution for maximum diversity problems. IEEE Transactions on Systems, Man and Cybernetics. Part B. Cybernetics, 39(4), 1048\u20131066.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics. Part B. Cybernetics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0898-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0898-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0898-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:06Z","timestamp":1559153286000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0898-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,15]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["898"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0898-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,15]]}}}