{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:33:30Z","timestamp":1740123210099,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T00:00:00Z","timestamp":1653436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T00:00:00Z","timestamp":1653436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2023,1]]},"DOI":"10.1007\/s10479-022-04764-7","type":"journal-article","created":{"date-parts":[[2022,5,25]],"date-time":"2022-05-25T22:02:33Z","timestamp":1653516153000},"page":"535-540","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Maximizing single attribute diversity in group selection"],"prefix":"10.1007","volume":"320","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7708-9806","authenticated-orcid":false,"given":"Sergey","family":"Kovalev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabelle","family":"Chalamon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio J.","family":"Petani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"issue":"1","key":"4764_CR1","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/0196-6774(91)90022-Q","volume":"12","author":"A Aggarwal","year":"1991","unstructured":"Aggarwal, A., Imai, H., Katoh, N., & Suri, S. (1991). Finding $$k$$ points with minimum diameter and related problems. Journal of Algorithms, 12(1), 38\u201356.","journal-title":"Journal of Algorithms"},{"key":"4764_CR2","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.ejor.2016.12.039","volume":"260","author":"Z Amirgaliyeva","year":"2017","unstructured":"Amirgaliyeva, Z., Mladenovi\u0107, N., Todosijevi\u0107, R., & Uro\u0161evi\u0107, D. (2017). Solving the maximum min-sum dispersion by alternating formulations of two different problems. European Journal of Operational Research, 260, 444\u2013459.","journal-title":"European Journal of Operational Research"},{"key":"4764_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ejor.2014.09.058","volume":"242","author":"R Aringhieri","year":"2015","unstructured":"Aringhieri, R., Cordone, R., & Grosso, A. (2015). Construction and improvement algorithms for dispersion problems. European Journal of Operational Research, 242, 21\u201333.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"4764_CR4","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M Blum","year":"1973","unstructured":"Blum, M., Floyd, R. W., Pratt, V. R., Rivest, R. L., & Tarjan, R. E. (1973). Time bounds for selection. Journal of Computer and System Sciences, 7(4), 448\u2013461.","journal-title":"Journal of Computer and System Sciences"},{"key":"4764_CR5","unstructured":"Cevallos, A., Eisenbrand, F., & Morell, S. (2018) Diversity maximization in doubling metrics. In 29th International symposium on algorithms and computation (ISAAC 2018) (pp. 33:1-33:12). Article No. 33, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany."},{"key":"4764_CR6","unstructured":"Cevallos, A., Eisenbrand, F., & Zenklusen, R. (2016) Max-sum diversity via convex programming. In 32nd Annual Symposium on Computational Geometry (SoCG) (pp. 26:1\u201326:14), LIPIcs Vol. 51, Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany."},{"issue":"4","key":"4764_CR7","doi-asserted-by":"publisher","first-page":"1144","DOI":"10.1086\/681213","volume":"120","author":"M De Vaan","year":"2015","unstructured":"De Vaan, M., Stark, D., & Vedres, B. (2015). Game changer: The topology of creativity. American Journal of Sociology, 120(4), 1144\u20131194.","journal-title":"American Journal of Sociology"},{"issue":"1","key":"4764_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10479-020-03705-6","volume":"295","author":"P Dutta","year":"2020","unstructured":"Dutta, P., Jain, A., & Gupta, A. (2020). Performance analysis of non-banking finance companies using two-stage data envelopment analysis. Annals of Operations Research, 295(1), 91\u2013116.","journal-title":"Annals of Operations Research"},{"key":"4764_CR9","doi-asserted-by":"crossref","unstructured":"Epasto, A., Mirrokni, V., & Zadimoghaddam, M. (2019). Scalable Diversity Maximization via small-size composable core-sets. In The 31st ACM symposium on parallelism in algorithms and architectures (pp. 41\u201342). Phoenix, AZ, USA.","DOI":"10.1145\/3323165.3323172"},{"key":"4764_CR10","doi-asserted-by":"crossref","unstructured":"Eremeev, A.V., Kel\u2019manov, A.V., Kovalyov, M.Y., & Pyatkin, A.V. (2019). Maximum diversity problem with squared Euclidean distance. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 11548 LNCS, pp. 541\u2013551.","DOI":"10.1007\/978-3-030-22629-9_38"},{"key":"4764_CR11","doi-asserted-by":"crossref","unstructured":"Fernandes, C. R., & Polzer, J. T. (2015). Diversity in groups. In R. Scott & S. Kosslyn (Eds.), Emerging Trends in the Social and Behavioral Sciences. Berlin: John Wiley & Sons Inc. ISBN 978-1-118-90077-2.","DOI":"10.1002\/9781118900772.etrds0082"},{"key":"4764_CR12","unstructured":"Hopcroft, J., & Kannan, R. (2012). Computer Science Theory for the Information Age. CiteSeerX."},{"key":"4764_CR13","doi-asserted-by":"crossref","unstructured":"Ianovski, E. (2021). Electing a committee with dominance constraints. Annals of Operations Research, in press.","DOI":"10.1007\/s10479-021-04128-7"},{"issue":"1\u20132","key":"4764_CR14","doi-asserted-by":"publisher","first-page":"1227","DOI":"10.1007\/s10479-018-2963-3","volume":"283","author":"L John","year":"2019","unstructured":"John, L., Gurumurthy, A., Soni, G., & Jain, V. (2019). Modelling the inter-relationship between factors affecting coordination in a humanitarian supply chain: A case of Chennai flood relief. Annals of Operations Research, 283(1\u20132), 1227\u20131258.","journal-title":"Annals of Operations Research"},{"key":"4764_CR15","doi-asserted-by":"crossref","unstructured":"Khan, H., Saif-ur-Rehman, Qadus, A., Jan, S.U., & Aamir, A. (2022). Adoption of eco-friendly cars: mediated effects of attitude and moderation role of gender diversity across UAE market: Application of extended version of theory of planned behaivour. Annals of Operations Research, in press.","DOI":"10.1007\/s10479-022-04605-7"},{"key":"4764_CR16","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1016\/j.ejor.2014.10.020","volume":"241","author":"TL Lei","year":"2015","unstructured":"Lei, T. L., & Church, R. L. (2015). On the unified dispersion problem: Efficient formulations and exact algorithms. European Journal of Operational Research, 241, 622\u2013630.","journal-title":"European Journal of Operational Research"},{"key":"4764_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","volume":"200","author":"R Mart\u00ed","year":"2010","unstructured":"Mart\u00ed, R., Gallego, M., & Duarte, A. (2010). A branch and bound algorithm for the maximum diversity problem. European Journal of Operational Research, 200, 36\u201344.","journal-title":"European Journal of Operational Research"},{"key":"4764_CR18","doi-asserted-by":"crossref","unstructured":"Moeini, M., Goerzen, D., & Wendt, O. (2018). A Local Search heuristic for solving the Maximum Dispersion Problem. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10751 LNAI, pp. 362\u2013371.","DOI":"10.1007\/978-3-319-75417-8_34"},{"issue":"2","key":"4764_CR19","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1287\/opre.42.2.299","volume":"42","author":"SS Ravi","year":"1994","unstructured":"Ravi, S. S., Rosenkrantz, D. J., & Tayi, G. K. (1994). Heuristic and special case algorithms for dispersion problems. Operations Research, 42(2), 299\u2013310.","journal-title":"Operations Research"},{"key":"4764_CR20","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ejor.2018.12.030","volume":"276","author":"RZ R\u00edos-Mercado","year":"2019","unstructured":"R\u00edos-Mercado, R. Z., & Bard, J. F. (2019). An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation. European Journal of Operational Research, 276, 259\u2013271.","journal-title":"European Journal of Operational Research"},{"issue":"1\u20132","key":"4764_CR21","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10479-018-2896-x","volume":"282","author":"AB Schmidt","year":"2019","unstructured":"Schmidt, A. B. (2019). Managing portfolio diversity within the mean variance theory. Annals of Operations Research, 282(1\u20132), 315\u2013329.","journal-title":"Annals of Operations Research"},{"key":"4764_CR22","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.cor.2018.08.009","volume":"101","author":"GK Tutunchi","year":"2019","unstructured":"Tutunchi, G. K., & Fathi, Y. (2019). Effective methods for solving the Bi-criteria p-Center and p-Dispersion problem. Computers and Operations Research, 101, 43\u201354.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"4764_CR23","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1086\/649497","volume":"115","author":"B Vedres","year":"2010","unstructured":"Vedres, B., & Stark, D. (2010). Generative disruption in overlapping groups. American Journal of Sociology, 115(4), 1150\u20131190.","journal-title":"American Journal of Sociology"},{"key":"4764_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(88)90174-3","volume":"28","author":"DW Wang","year":"1988","unstructured":"Wang, D. W., & Kuo, Y.-S. (1988). A study on two geometric location problems. Information Processing Letters, 28, 281\u2013286.","journal-title":"Information Processing Letters"},{"issue":"1\u20132","key":"4764_CR25","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-016-2328-8","volume":"263","author":"S Yasar Saglam","year":"2018","unstructured":"Yasar Saglam, S., & Street, W. N. (2018). Distant diversity in dynamic class prediction. Annals of Operations Research, 263(1\u20132), 5\u201319.","journal-title":"Annals of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04764-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-04764-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04764-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T17:30:14Z","timestamp":1673371814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-04764-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,25]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1]]}},"alternative-id":["4764"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-04764-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2022,5,25]]},"assertion":[{"value":"2 May 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}