{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T02:08:26Z","timestamp":1771898906859,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,12,1]],"date-time":"2019-12-01T00:00:00Z","timestamp":1575158400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1109\/ieem44572.2019.8978840","type":"proceedings-article","created":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T21:27:12Z","timestamp":1580765232000},"page":"335-339","source":"Crossref","is-referenced-by-count":8,"title":["A Binary Linear Programming-Based K-Means Approach for the Capacitated Centered Clustering Problem"],"prefix":"10.1109","author":[{"given":"Philipp","family":"Baumann","sequence":"first","affiliation":[{"name":"University of Bern,Department of Business Administration,Bern,Switzerland,3012"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9143-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2004.11.011"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref6","article-title":"Constrained k-means clustering","author":"bradley","year":"2000","journal-title":"MSR - TR - 2000–65 Microsoft Research Redmond Tech Rep"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1023\/A:1027353520175"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1155\/2018\/3605298"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1111\/itor.12103"},{"key":"ref8","first-page":"52","article-title":"Improved k - means algorithm for capacitated clustering problem","volume":"8","author":"geetha","year":"2009","journal-title":"INFOCOMP Journal of Computer Science"},{"key":"ref7","first-page":"577","article-title":"Constrained k-means clustering with background knowledge","author":"wagstaff","year":"0","journal-title":"Proceedings of the Eighteenth International Conference on Machine Learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2018.07.031"},{"key":"ref9","first-page":"1027","article-title":"k-mcans++: The advantages of careful seeding","author":"arthur","year":"0","journal-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2018.08.043"}],"event":{"name":"2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)","location":"Macao, China","start":{"date-parts":[[2019,12,15]]},"end":{"date-parts":[[2019,12,18]]}},"container-title":["2019 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8961317\/8978490\/08978840.pdf?arnumber=8978840","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:09:08Z","timestamp":1757095748000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8978840\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/ieem44572.2019.8978840","relation":{},"subject":[],"published":{"date-parts":[[2019,12]]}}}