{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:48:49Z","timestamp":1782928129965,"version":"3.54.5"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s10878-026-01427-2","type":"journal-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:08:58Z","timestamp":1782925738000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["New integer linear programming formulations for the maximally diverse grouping problem"],"prefix":"10.1007","volume":"51","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1535-7059","authenticated-orcid":false,"given":"Kevin Fu Yuan","family":"Lam","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiang","family":"Qian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,1]]},"reference":[{"issue":"1","key":"1427_CR1","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1111\/j.1540-5915.1986.tb00215.x","volume":"17","author":"M Beheshtian-Ardekani","year":"1986","unstructured":"Beheshtian-Ardekani M, Mahmood MA (1986) Education development and validation of a tool for assigning students to groups for class projects. Decis Sci 17(1):92\u2013113","journal-title":"Decis Sci"},{"key":"1427_CR2","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s11590-015-0869-4","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg J, Jani\u0107ijevi\u0107 S, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2017) Solving the clique partitioning problem as a maximally diverse grouping problem. Opt Lett 11:1123\u20131135","journal-title":"Opt Lett"},{"issue":"7","key":"1427_CR3","doi-asserted-by":"publisher","first-page":"1423","DOI":"10.1057\/jors.2010.92","volume":"62","author":"ZP Fan","year":"2011","unstructured":"Fan ZP, Chen Y, Ma J, Zeng S (2011) Erratum: a hybrid genetic algorithmic approach to the maximally diverse grouping problem. J of the Oper Res Soc 62(7):1423\u20131430","journal-title":"J of the Oper Res Soc"},{"issue":"2","key":"1427_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.3230200205","volume":"20","author":"TA Feo","year":"1990","unstructured":"Feo TA, Khellaf M (1990) A class of bounded approximation algorithms for graph partitioning. Netw 20(2):181\u2013195","journal-title":"Netw"},{"issue":"5","key":"1427_CR5","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1057\/jors.2012.66","volume":"64","author":"M Gallego","year":"2013","unstructured":"Gallego M, Laguna M, Mart\u00ed R, Duarte A (2013) Tabu search with strategic oscillation for the maximally diverse grouping problem. J of the Oper Res Soc 64(5):724\u2013734","journal-title":"J of the Oper Res Soc"},{"key":"1427_CR6","doi-asserted-by":"crossref","unstructured":"Gower JC (1971) A general coefficient of similarity and some of its properties. Biometrics 857\u2013871","DOI":"10.2307\/2528823"},{"key":"1427_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel M, Wakabayashi Y (1989) A cutting plane algorithm for a clustering problem. Math Program 45:59\u201396","journal-title":"Math Program"},{"key":"1427_CR8","doi-asserted-by":"crossref","unstructured":"Hettich S, Pazzani MJ (2006) Mining for proposal reviewers: lessons learned at the national science foundation. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 862\u2013871","DOI":"10.1145\/1150402.1150521"},{"key":"1427_CR9","volume-title":"50 Years of integer programming 1958\u20132008: from the early years to the state-of-the-art","author":"M J\u00fcnger","year":"2009","unstructured":"J\u00fcnger M, Liebling TM, Naddef D, Nemhauser GL, Pulleyblank WR, Reinelt G, Rinaldi G, Wolsey LA (2009) 50 Years of integer programming 1958\u20132008: from the early years to the state-of-the-art. Springer Science & Business Media"},{"issue":"2","key":"1427_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1145\/5657.5658","volume":"29","author":"RM Karp","year":"1986","unstructured":"Karp RM (1986) Combinatorics, complexity, and randomness. Commun ACM 29(2):98\u2013109","journal-title":"Commun ACM"},{"issue":"3","key":"1427_CR11","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/j.ejor.2020.07.048","volume":"289","author":"X Lai","year":"2021","unstructured":"Lai X, Hao JK, Fu ZH, Yue D (2021) Neighborhood decomposition based variable neighborhood search and tabu search for maximally diverse grouping. Eur J Oper Res 289(3):1067\u20131086","journal-title":"Eur J Oper Res"},{"issue":"4","key":"1427_CR12","doi-asserted-by":"publisher","first-page":"277","DOI":"10.5755\/j01.itc.40.4.977","volume":"40","author":"G Palubeckis","year":"2011","unstructured":"Palubeckis G, Kar\u010diauskas E, Ri\u0161kus A (2011) Comparative performance of three metaheuristic approaches for the maximally diverse grouping problem. Inform Technol and Control 40(4):277\u2013285","journal-title":"Inform Technol and Control"},{"issue":"2","key":"1427_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1037\/met0000301","volume":"26","author":"M Papenberg","year":"2021","unstructured":"Papenberg M, Klau GW (2021) Using anticlustering to partition data sets into equivalent parts. Psychol Methods 26(2):161","journal-title":"Psychol Methods"},{"key":"1427_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2019.100643","volume":"53","author":"O Ramos-Figueroa","year":"2020","unstructured":"Ramos-Figueroa O, Quiroz-Castellanos M, Mezura-Montes E, Sch\u00fctze O (2020) Metaheuristics to solve grouping problems: a review and a case study. Swarm Evol Comput 53:100643","journal-title":"Swarm Evol Comput"},{"issue":"4","key":"1427_CR15","first-page":"2","volume":"4","author":"D Rock","year":"2016","unstructured":"Rock D, Grant H (2016) Why diverse teams are smarter. Harv Bus Rev 4(4):2\u20135","journal-title":"Harv Bus Rev"},{"key":"1427_CR16","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.ins.2012.12.020","volume":"230","author":"FJ Rodriguez","year":"2013","unstructured":"Rodriguez FJ, Lozano M, Garc\u00eda-Mart\u00ednez C, Gonz\u00e1lez-Barrera JD (2013) An artificial bee colony algorithm for the maximally diverse grouping problem. Inf Sci 230:183\u2013196","journal-title":"Inf Sci"},{"issue":"1","key":"1427_CR17","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s10479-022-04707-2","volume":"318","author":"A Schulz","year":"2022","unstructured":"Schulz A (2022) A new mixed-integer programming formulation for the maximally diverse grouping problem with attribute values. Ann Oper Res 318(1):501\u2013530","journal-title":"Ann Oper Res"},{"issue":"10","key":"1427_CR18","doi-asserted-by":"publisher","first-page":"2921","DOI":"10.1007\/s13042-018-00914-1","volume":"10","author":"K Singh","year":"2019","unstructured":"Singh K, Sundar S (2019) A new hybrid genetic algorithm for the maximally diverse grouping problem. Int J Mach Learn Cybern 10(10):2921\u20132940","journal-title":"Int J Mach Learn Cybern"},{"issue":"6","key":"1427_CR19","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1057\/palgrave.jors.2600510","volume":"49","author":"RR Weitz","year":"1998","unstructured":"Weitz RR, Lakshminarayanan S (1998) An empirical comparison of heuristic methods for creating maximally diverse groups. J of the Oper Res Soc 49(6):635\u2013646","journal-title":"J of the Oper Res Soc"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01427-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-026-01427-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-026-01427-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:09:08Z","timestamp":1782925748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-026-01427-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["1427"],"URL":"https:\/\/doi.org\/10.1007\/s10878-026-01427-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"30 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"61"}}