{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T04:39:09Z","timestamp":1778819949154,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319070452","type":"print"},{"value":"9783319070469","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07046-9_31","type":"book-chapter","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T02:07:28Z","timestamp":1399860448000},"page":"438-454","source":"Crossref","is-referenced-by-count":26,"title":["Constrained Clustering Using Column Generation"],"prefix":"10.1007","author":[{"given":"Behrouz","family":"Babaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tias","family":"Guns","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siegfried","family":"Nijssen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"31_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T. Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Mathematical Programming Computation\u00a01(1), 1\u201341 (2009)","journal-title":"Mathematical Programming Computation"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10994-009-5103-0","volume":"75","author":"D. Aloise","year":"2009","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of euclidean sum-of-squares clustering. Machine Learning\u00a075(2), 245\u2013248 (2009)","journal-title":"Machine Learning"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1590\/S0101-74382009000300002","volume":"29","author":"D. Aloise","year":"2009","unstructured":"Aloise, D., Hansen, P.: A branch-and-cut SDP-based algorithm for minimum sum-of-squares clustering. Pesquisa Operacional\u00a029, 503\u2013516 (2009)","journal-title":"Pesquisa Operacional"},{"issue":"1-2","key":"31_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10107-010-0349-7","volume":"131","author":"D. Aloise","year":"2012","unstructured":"Aloise, D., Hansen, P., Liberti, L.: An improved column generation algorithm for minimum sum-of-squares clustering. Mathematical Programming\u00a0131(1-2), 195\u2013220 (2012)","journal-title":"Mathematical Programming"},{"key":"31_CR5","unstructured":"Bache, K., Lichman, M.: UCI machine learning repository (2013)"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Basu, S., Davidson, I., Wagstaff, K.: Constrained Clustering: Advances in Algorithms, Theory, and Applications. Chapman & Hall\/CRC Press (2008)","DOI":"10.1201\/9781584889977"},{"key":"31_CR7","unstructured":"Brusco, M.J., Stahl, S.: Minimum within-cluster sums of squares partitioning. In: Branch-and-Bound Applications in Combinatorial Data Analysis. Springer (2005)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-40994-3_27","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"T.-B.-H. Dao","year":"2013","unstructured":"Dao, T.-B.-H., Duong, K.-C., Vrain, C.: A declarative framework for constrained clustering. In: Blockeel, H., Kersting, K., Nijssen, S., \u017delezn\u00fd, F. (eds.) ECML PKDD 2013, Part III. LNCS, vol.\u00a08190, pp. 419\u2013434. Springer, Heidelberg (2013)"},{"issue":"1","key":"31_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10618-006-0053-7","volume":"14","author":"I. Davidson","year":"2007","unstructured":"Davidson, I., Ravi, S.S.: The complexity of non-hierarchical clustering with instance and cluster level constraints. Data Min. Knowl. Discov.\u00a014(1), 25\u201361 (2007)","journal-title":"Data Min. Knowl. Discov."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Davidson, I., Ravi, S.S., Shamis, L.: A sat-based framework for efficient constrained clustering. In: SDM, pp. 94\u2013105 (2010)","DOI":"10.1137\/1.9781611972801.9"},{"key":"31_CR11","unstructured":"Demiriz, A., Bennett, K., Bradley, P.: Using assignment constraints to avoid empty clusters in k-means clustering. In: Constrained Clustering: Algorithms, Applications and Theory. Chapman & Hall\/CRC (2008)"},{"issue":"2","key":"31_CR12","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/0906020","volume":"6","author":"G. Diehr","year":"1985","unstructured":"Diehr, G.: Evaluation of a branch and bound algorithm for clustering. SIAM Journal on Scientific and Statistical Computing\u00a06(2), 268\u2013284 (1985)","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"issue":"7","key":"31_CR13","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W. Dinkelbach","year":"1967","unstructured":"Dinkelbach, W.: On nonlinear fractional programming. Management Science\u00a013(7), 492\u2013498 (1967)","journal-title":"Management Science"},{"issue":"4","key":"31_CR14","doi-asserted-by":"publisher","first-page":"1485","DOI":"10.1137\/S1064827597328327","volume":"21","author":"O. du Merle","year":"1999","unstructured":"du Merle, O., Hansen, P., Jaumard, B., Mladenovic, N.: An interior point algorithm for minimum sum-of-squares clustering. SIAM J. Sci. Comput.\u00a021(4), 1485\u20131505 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Gondek, D., Hofmann, T.: Non-redundant data clustering. In: ICDM, pp. 75\u201382 (2004)","DOI":"10.1109\/ICDM.2004.10104"},{"issue":"6","key":"31_CR16","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1287\/opre.17.6.1034","volume":"17","author":"R.E. Jensen","year":"1969","unstructured":"Jensen, R.E.: A dynamic programming algorithm for cluster analysis. Operations Research\u00a017(6), 1034\u20131057 (1969)","journal-title":"Operations Research"},{"issue":"1-3","key":"31_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"E.L. Johnson","year":"1993","unstructured":"Johnson, E.L., Mehrotra, A., Nemhauser, G.L.: Min-cut clustering. Mathematical Programming\u00a062(1-3), 133\u2013151 (1993)","journal-title":"Mathematical Programming"},{"issue":"9","key":"31_CR18","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1109\/T-C.1975.224336","volume":"24","author":"W.L.G. Koontz","year":"1975","unstructured":"Koontz, W.L.G., Narendra, P.M., Fukunaga, K.: A branch and bound clustering algorithm. IEEE Trans. Comput.\u00a024(9), 908\u2013915 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-642-16184-1_12","volume-title":"Discovery Science","author":"M. Mueller","year":"2010","unstructured":"Mueller, M., Kramer, S.: Integer linear programming models for constrained clustering. In: Pfahringer, B., Holmes, G., Hoffmann, A. (eds.) DS 2010. LNCS, vol.\u00a06332, pp. 159\u2013173. Springer, Heidelberg (2010)"},{"issue":"2","key":"31_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00357-004-0017-9","volume":"21","author":"B. Os","year":"2004","unstructured":"Os, B., Meulman, J.: Improving dynamic programming strategies for partitioning. Journal of Classification\u00a021(2), 207\u2013230 (2004)","journal-title":"Journal of Classification"},{"issue":"3","key":"31_CR21","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.ejor.2005.04.048","volume":"173","author":"B. Saglam","year":"2006","unstructured":"Saglam, B., Salman, F.S., Sayin, S., T\u00fcrkay, M.: A mixed-integer programming approach to the clustering problem with an application in customer segmentation. European Journal of Operational Research\u00a0173(3), 866\u2013879 (2006)","journal-title":"European Journal of Operational Research"},{"key":"31_CR22","unstructured":"Schrijver, A.: Combinatorial Optimization \u2013 Polyhedra and Efficiency. Springer (2003)"},{"key":"31_CR23","unstructured":"Wagstaff, K., Cardie, C.: Clustering with instance-level constraints. In: ICML, pp. 1103\u20131110 (2000)"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Xia, Y., Peng, J.: A cutting algorithm for the minimum sum-of-squared error clustering. In: SDM (2005)","DOI":"10.1137\/1.9781611972757.14"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07046-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T21:47:20Z","timestamp":1746222440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07046-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070452","9783319070469"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07046-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}