{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T20:16:04Z","timestamp":1769890564165,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T00:00:00Z","timestamp":1760486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["307987\/2023-0"],"award-info":[{"award-number":["307987\/2023-0"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s40314-025-03442-1","type":"journal-article","created":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T05:21:36Z","timestamp":1760505696000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An approach to the clustering problem with capacity constraints"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2961-2647","authenticated-orcid":false,"given":"Kl\u00e9ber A.","family":"Benatti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-5862-3465","authenticated-orcid":false,"given":"Jo\u00e3o V.","family":"Pamplona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1516-119X","authenticated-orcid":false,"given":"Lucas G.","family":"Pedroso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9176-2999","authenticated-orcid":false,"given":"Ademir A.","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"3442_CR1","unstructured":"Backurs A, Indyk P, Onak K, Schieber B, Vakilian A, Wagner T(2019) Scalable fair clustering. In: Chaudhuri K, Salakhutdinov R (eds) Proceedings of the 36th international conference on machine learning. Proceedings of machine learning research, vol 97. PMLR, California, pp 405\u2013413"},{"key":"3442_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10618-006-0040-z","volume":"13","author":"A Banerjee","year":"2006","unstructured":"Banerjee A, Ghosh J (2006) Scalable clustering algorithms with balancing constraints. Data Min Knowl Discov 13:365\u2013395. https:\/\/doi.org\/10.1007\/s10618-006-0040-z","journal-title":"Data Min Knowl Discov"},{"key":"3442_CR3","doi-asserted-by":"publisher","unstructured":"Baranwal M, Salapaka SM (2017) Clustering with capacity and size constraints: a deterministic approach. In: 2017 Indian control conference (ICC). IEEE, Guwahati, pp 251\u2013256.https:\/\/doi.org\/10.1109\/INDIANCC.2017.7846483","DOI":"10.1109\/INDIANCC.2017.7846483"},{"key":"3442_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ins.2022.10.040","volume":"616","author":"KA Benatti","year":"2022","unstructured":"Benatti KA, Pedroso LG, Ribeiro AA (2022) Theoretical analysis of classic and capacity constrained fuzzy clustering. Inf Sci 616:127\u2013140. https:\/\/doi.org\/10.1016\/j.ins.2022.10.040","journal-title":"Inf Sci"},{"key":"3442_CR5","volume-title":"Pattern recognition and machine learning. Information science and statistics","author":"CM Bishop","year":"2006","unstructured":"Bishop CM (2006) Pattern recognition and machine learning. Information science and statistics. Springer, New York"},{"key":"3442_CR6","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/s11750-024-00668-w","volume":"32","author":"JP Burgard","year":"2024","unstructured":"Burgard JP, Pinheiro ME, Schmidt M (2024a) Mixed-integer quadratic optimization and iterative clustering techniques for semi-supervised support vector machines. Int Trans Oper Res 32:391\u2013428. https:\/\/doi.org\/10.1007\/s11750-024-00668-w","journal-title":"Int Trans Oper Res"},{"key":"3442_CR7","unstructured":"Burgard JP, Pinheiro ME, Schmidt M (2024b) Mixed-integer linear optimization for semi-supervised optimal classification trees. arXiv preprint. arXiv:2401.09848"},{"key":"3442_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-025-02191-8","author":"JP Burgard","year":"2025","unstructured":"Burgard JP, Pinheiro ME, Schmidt M (2025) Mixed-integer linear optimization for cardinality-constrained random forests. Optim Lett. https:\/\/doi.org\/10.1007\/s11590-025-02191-8","journal-title":"Optim Lett"},{"issue":"3","key":"3442_CR9","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1016\/j.cor.2008.09.011","volume":"37","author":"AA Chaves","year":"2010","unstructured":"Chaves AA, Lorena LAN (2010) Clustering search algorithm for the capacitated centered clustering problem. Comput Oper Res 37(3):552\u2013558. https:\/\/doi.org\/10.1016\/j.cor.2008.09.011","journal-title":"Comput Oper Res"},{"key":"3442_CR10","doi-asserted-by":"publisher","unstructured":"Ganganath N, Cheng C, Tse C (2014) Data clustering with cluster size constraints using a modified K-means algorithm. In: Proceedings of the 2014 international conference on cyber-enabled distributed computing and knowledge discovery, CyberC 2014. IEEE, Shanghai, pp 158\u2013161. https:\/\/doi.org\/10.1109\/CyberC.2014.36","DOI":"10.1109\/CyberC.2014.36"},{"issue":"4","key":"3442_CR11","first-page":"52","volume":"8","author":"S Geetha","year":"2009","unstructured":"Geetha S, Poonthalir G, Vanathi PT (2009) Improved k-means algorithm for capacitated clustering problem. INFOCOMP J Comput Sci 8(4):52\u201359","journal-title":"INFOCOMP J Comput Sci"},{"key":"3442_CR12","series-title":"Adaptive computation and machine learning series","volume-title":"Deep learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow I, Bengio Y, Courville A (2016) Deep learning. Adaptive computation and machine learning series. MIT Press, Cambridge"},{"key":"3442_CR13","doi-asserted-by":"publisher","unstructured":"H\u00f6ppner F, Klawonn F (2008) Clustering with size constraints. In: Jain LC, Sato-Ilic M, Virvou M, Tsihrintzis GA, Balas VE, Abeynayake C (eds) Comp. Intel Para: Innov Applications. Springer, Berlin, pp 167\u2013180. https:\/\/doi.org\/10.1007\/978-3-540-79474-5_8","DOI":"10.1007\/978-3-540-79474-5_8"},{"key":"3442_CR14","unstructured":"Kelly M, Longjohn R, Nottingham K (2023) The UCI machine learning repository. https:\/\/archive.ics.uci.edu"},{"key":"3442_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63913-0","volume-title":"An introduction to machine learning","author":"M Kubat","year":"2017","unstructured":"Kubat M (2017) An introduction to machine learning, 2nd edn. Springer, Cham","edition":"2"},{"key":"3442_CR16","doi-asserted-by":"publisher","unstructured":"Li T, Li L, Zhang XF (2025) Randomized block residual steepest descent method with K-means clustering for large sparse linear systems. Comput Appl Math 44(286). https:\/\/doi.org\/10.1007\/s40314-025-03238-3","DOI":"10.1007\/s40314-025-03238-3"},{"key":"3442_CR17","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1023\/A:1027353520175","volume":"3","author":"LAN Lorena","year":"2003","unstructured":"Lorena LAN, Senne ELF (2003) Local search heuristics for capacitated p-median problems. NETS Netw Spat Econ 3:407\u2013419. https:\/\/doi.org\/10.1023\/A:1027353520175","journal-title":"NETS Netw Spat Econ"},{"key":"3442_CR18","doi-asserted-by":"publisher","unstructured":"Malinen MI, Fr\u00e4nti P (2014) Balanced K-means for clustering. In: Fr\u00e4nti P, Brown G, Loog M, Escolano F, Pelillo M (eds) Structural, syntactic, and statistical pattern recognition. Springer, Berlin, pp 32\u201341. https:\/\/doi.org\/10.1007\/978-3-662-44415-3_4","DOI":"10.1007\/978-3-662-44415-3_4"},{"key":"3442_CR19","unstructured":"MATLAB (2019) R2019a. The MathWorks Inc., Natick, Massachusetts"},{"issue":"3","key":"3442_CR20","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0377-2217(84)90155-3","volume":"18","author":"JM Mulvey","year":"1984","unstructured":"Mulvey JM, Beck MP (1984) Solving capacitated clustering problems. Eur J Oper Res 18(3):339\u2013348. https:\/\/doi.org\/10.1016\/0377-2217(84)90155-3","journal-title":"Eur J Oper Res"},{"issue":"6","key":"3442_CR21","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1016\/j.cor.2004.11.011","volume":"33","author":"M Negreiros","year":"2006","unstructured":"Negreiros M, Palhano A (2006) The capacitated centred clustering problem. Comput Oper Res 33(6):1639\u20131663. https:\/\/doi.org\/10.1016\/j.cor.2004.11.011","journal-title":"Comput Oper Res"},{"issue":"3","key":"3442_CR22","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","volume":"1","author":"IH Osman","year":"1994","unstructured":"Osman IH, Christofides N (1994) Capacitated clustering problems by hybrid simulated annealing and tabu search. Int Trans Oper Res 1(3):317\u2013336. https:\/\/doi.org\/10.1016\/0969-6016(94)90032-9","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"3442_CR23","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/j.ejor.2004.08.014","volume":"169","author":"S Scheuerer","year":"2006","unstructured":"Scheuerer S, Wendolsky R (2006) A scatter search heuristic for the capacitated clustering problem. Eur J Oper Res 169(2):533\u2013547. https:\/\/doi.org\/10.1016\/j.ejor.2004.08.014","journal-title":"Eur J Oper Res"},{"key":"3442_CR24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1111\/itor.12103","volume":"22","author":"F Stefanello","year":"2014","unstructured":"Stefanello F, Ara\u00fajo O, M\u00fcller F (2014) Matheuristics for the capacitated p-median problem. Int Trans Oper Res 22:149\u2013167. https:\/\/doi.org\/10.1111\/itor.12103","journal-title":"Int Trans Oper Res"},{"key":"3442_CR25","doi-asserted-by":"publisher","unstructured":"Tang W, Yang Y, Zeng L, Zhan Y (2019) Optimizing MSE for clustering with balanced size constraints. Symmetry 11(3). https:\/\/doi.org\/10.3390\/sym11030338","DOI":"10.3390\/sym11030338"},{"key":"3442_CR26","doi-asserted-by":"publisher","first-page":"1587","DOI":"10.1109\/ACCESS.2019.2962191","volume":"8","author":"W Tang","year":"2020","unstructured":"Tang W, Yang Y, Zeng L, Zhan Y (2020) Size constrained clustering with MILP formulation. IEEE Access 8:1587\u20131599. https:\/\/doi.org\/10.1109\/ACCESS.2019.2962191","journal-title":"IEEE Access"},{"key":"3442_CR27","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.artint.2015.05.006","volume":"244","author":"D Thi-Bich-Hanh","year":"2017","unstructured":"Thi-Bich-Hanh D, Khanh-Chuong D, Vrain C (2017) Constrained clustering by constraint programming. Artif Intell 244:70\u201394. https:\/\/doi.org\/10.1016\/j.artint.2015.05.006","journal-title":"Artif Intell"},{"key":"3442_CR28","doi-asserted-by":"publisher","unstructured":"Wang Z, Chen L, Chen H, Wang X (2025) Clustering single-cell data based on a deep embedded subspace model. Comput Appl Math 44(302). https:\/\/doi.org\/10.1007\/s40314-025-03268-x","DOI":"10.1007\/s40314-025-03268-x"},{"key":"3442_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2025.109529","volume":"166","author":"X Zhang","year":"2025","unstructured":"Zhang X, Xiao M, He Z (2025) Orthogonal block Kaczmarz inner-iteration preconditioned flexible GMRES method for large-scale linear systems. Appl Math Lett 166:109529. https:\/\/doi.org\/10.1016\/j.aml.2025.109529","journal-title":"Appl Math Lett"},{"key":"3442_CR30","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1007\/s00500-023-09309-z","volume":"28","author":"H Zhou","year":"2024","unstructured":"Zhou H, Wang Z, Chen H, Wang X (2024) A novel spectral clustering algorithm based on neighbor relation and gaussian kernel function with only one parameter. Soft Comput 28:981\u2013989. https:\/\/doi.org\/10.1007\/s00500-023-09309-z","journal-title":"Soft Comput"},{"issue":"8","key":"3442_CR31","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/j.knosys.2010.06.003","volume":"23","author":"S Zhu","year":"2010","unstructured":"Zhu S, Wang D, Li T (2010) Data clustering with size constraints. Knowl Based Syst 23(8):883\u2013889. https:\/\/doi.org\/10.1016\/j.knosys.2010.06.003","journal-title":"Knowl Based Syst"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03442-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-025-03442-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-025-03442-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T04:45:56Z","timestamp":1769834756000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-025-03442-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["3442"],"URL":"https:\/\/doi.org\/10.1007\/s40314-025-03442-1","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,15]]},"assertion":[{"value":"3 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing financial interests, conflict of interest, other competing interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"52"}}