{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T07:08:15Z","timestamp":1780988895170,"version":"3.54.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T00:00:00Z","timestamp":1771804800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSFC Major Research Plan","award":["No.92270205"],"award-info":[{"award-number":["No.92270205"]}]},{"name":"the National Key R&D Program of China","award":["Nos.2022YFA1005201,2022YFA1005202, 2022YFA1005203"],"award-info":[{"award-number":["Nos.2022YFA1005201,2022YFA1005202, 2022YFA1005203"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s10957-026-02944-0","type":"journal-article","created":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T13:32:40Z","timestamp":1771853560000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Equivalent Network Flow Model for the Nonuniform Capacity-Constrained Clustering Problem"],"prefix":"10.1007","volume":"208","author":[{"given":"Lu","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andong","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinxiang","family":"Hou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhouwang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,2,23]]},"reference":[{"issue":"1","key":"2944_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-013-1425-1","volume":"222","author":"H Ackermann","year":"2014","unstructured":"Ackermann, H., Ewe, H., K\u00fcfer, K.H., Schr\u00f6der, M.: Modeling profit sharing in combinatorial exchanges by network flows. Ann. Oper. Res. 222(1), 5\u201328 (2014). https:\/\/doi.org\/10.1007\/s10479-013-1425-1","journal-title":"Ann. Oper. Res."},{"key":"2944_CR2","doi-asserted-by":"publisher","unstructured":"Baranwal, M., Salapaka, S.M.: Clustering with capacity and size constraints: A deterministic approach. In: 2017 Indian Control Conference (ICC), pp. 251\u2013256. IEEE (2017). https:\/\/doi.org\/10.1109\/INDIANCC.2017.7846483","DOI":"10.1109\/INDIANCC.2017.7846483"},{"issue":"10","key":"2944_CR3","first-page":"2278","volume":"1","author":"AM Baswade","year":"2012","unstructured":"Baswade, A.M., Joshi, K.D., Nalwade, P.S.: A comparative study of k-means and weighted k-means for clustering. Intern. J. Eng. Res. & Technol. (IJERT) 1(10), 2278\u20130181 (2012)","journal-title":"Intern. J. Eng. Res. & Technol. (IJERT)"},{"key":"2944_CR4","doi-asserted-by":"publisher","unstructured":"Baumann, P.: A binary linear programming-based k-means approach for the capacitated centered clustering problem. In: 2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), pp. 335\u2013339 (2019). https:\/\/doi.org\/10.1109\/IEEM44572.2019.8978840","DOI":"10.1109\/IEEM44572.2019.8978840"},{"key":"2944_CR5","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ins.2022.10.040","volume":"616","author":"KA Benatti","year":"2022","unstructured":"Benatti, K.A., Pedroso, L.G., Ribeiro, A.A.: Theoretical analysis of classic and capacity constrained fuzzy clustering. Inf. Sci. 616, 127\u2013140 (2022). https:\/\/doi.org\/10.1016\/j.ins.2022.10.040","journal-title":"Inf. Sci."},{"issue":"2","key":"2944_CR6","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1109\/TNSM.2018.2816263","volume":"15","author":"M Bouet","year":"2018","unstructured":"Bouet, M., Conan, V.: Mobile edge computing resources optimization: A geo-clustering approach. IEEE Trans. Netw. Serv. Manage. 15(2), 787\u2013796 (2018). https:\/\/doi.org\/10.1109\/TNSM.2018.2816263","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"2944_CR7","unstructured":"Bradley, P.S., Bennett, K.P., Demiriz, A.: Constrained k-means clustering. Microsoft Research, Redmond 20 (2000)"},{"issue":"1","key":"2944_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.ejor.2017.04.018","volume":"263","author":"A Brieden","year":"2017","unstructured":"Brieden, A., Gritzmann, P., Klemm, F.: Constrained clustering via diagrams: A unified theory and its application to electoral district design. Eur. J. Oper. Res. 263(1), 18\u201334 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.04.018","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2944_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10479-012-1234-y","volume":"218","author":"P Brucker","year":"2014","unstructured":"Brucker, P., Qu, R.: Network flow models for intraday personnel scheduling problems. Ann. Oper. Res. 218(1), 107\u2013114 (2014). https:\/\/doi.org\/10.1007\/s10479-012-1234-y","journal-title":"Ann. Oper. Res."},{"key":"2944_CR10","doi-asserted-by":"publisher","unstructured":"de Amorim, R.C.: Constrained clustering with minkowski weighted k-means. In: 2012 IEEE 13th International Symposium on Computational Intelligence and Informatics (CINTI), pp. 13\u201317 (2012). https:\/\/doi.org\/10.1109\/CINTI.2012.6496753","DOI":"10.1109\/CINTI.2012.6496753"},{"key":"2944_CR11","doi-asserted-by":"publisher","unstructured":"Dinler, D., Tural, M.K.: A survey of constrained clustering. In: M.E. Celebi, K. Aydin (eds.) Unsupervised Learning Algorithms, pp. 207\u2013235. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-24211-8_9","DOI":"10.1007\/978-3-319-24211-8_9"},{"issue":"3","key":"2944_CR12","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1111\/tgis.12289","volume":"21","author":"S Gao","year":"2017","unstructured":"Gao, S., Janowicz, K., Couclelis, H.: Extracting urban functional regions from points of interest and human activities on location-based social networks. Trans. GIS 21(3), 446\u2013467 (2017). https:\/\/doi.org\/10.1111\/tgis.12289","journal-title":"Trans. GIS"},{"key":"2944_CR13","doi-asserted-by":"publisher","unstructured":"H\u00f6ppner, F., Klawonn, F.: Clustering with size constraints. In: L.C. Jain, M. Sato-Ilic, M. Virvou, G.A. Tsihrintzis, V.E. Balas, C. Abeynayake (eds.) Computational Intelligence Paradigms: Innovative Applications, pp. 167\u2013180. Springer, Berlin Heidelberg, Berlin, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79474-5_8","DOI":"10.1007\/978-3-540-79474-5_8"},{"issue":"1","key":"2944_CR14","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s40745-014-0003-y","volume":"1","author":"M Lewis","year":"2014","unstructured":"Lewis, M., Wang, H., Kochenberger, G.: Exact solutions to the capacitated clustering problem: A comparison of two models. Ann. Data. Sci. 1(1), 15\u201323 (2014)","journal-title":"Ann. Data. Sci."},{"key":"2944_CR15","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.ins.2022.01.032","volume":"591","author":"Y Liu","year":"2022","unstructured":"Liu, Y., Guo, P., Zeng, Y.: Meaccp: A membrane evolutionary algorithm for capacitated clustering problem. Inf. Sci. 591, 319\u2013343 (2022). https:\/\/doi.org\/10.1016\/j.ins.2022.01.032","journal-title":"Inf. Sci."},{"key":"2944_CR16","unstructured":"MacQueen, J. et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, vol. 1, pp. 281\u2013297. Oakland, CA, USA (1967)"},{"key":"2944_CR17","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1016\/j.trc.2020.01.019","volume":"114","author":"M Salama","year":"2020","unstructured":"Salama, M., Srinivas, S.: Joint optimization of customer location clustering and drone-based routing for last-mile deliveries. Transp. Res. Part C: Emerg. Technol. 114, 620\u2013642 (2020). https:\/\/doi.org\/10.1016\/j.trc.2020.01.019","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"issue":"2","key":"2944_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s40745-015-0040-1","volume":"2","author":"D Xu","year":"2015","unstructured":"Xu, D., Tian, Y.: A Comprehensive Survey of Clustering Algorithms. Ann. Data. Sci. 2(2), 165\u2013193 (2015). https:\/\/doi.org\/10.1007\/s40745-015-0040-1","journal-title":"Ann. Data. Sci."},{"issue":"11","key":"2944_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0895-7177(93)90202-A","volume":"18","author":"MS Yang","year":"1993","unstructured":"Yang, M.S.: A survey of fuzzy clustering. Math. Comput. Model. 18(11), 1\u201316 (1993). https:\/\/doi.org\/10.1016\/0895-7177(93)90202-A","journal-title":"Math. Comput. Model."},{"issue":"8","key":"2944_CR20","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.: Data clustering with size constraints. Knowl.-Based Syst. 23(8), 883\u2013889 (2010). https:\/\/doi.org\/10.1016\/j.knosys.2010.06.003","journal-title":"Knowl.-Based Syst."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-02944-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-02944-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-02944-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T06:48:26Z","timestamp":1780987706000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-02944-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,23]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["2944"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-02944-0","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,23]]},"assertion":[{"value":"12 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"116"}}