{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T19:43:24Z","timestamp":1781552604257,"version":"3.54.5"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,7,8]],"date-time":"2010-07-08T00:00:00Z","timestamp":1278547200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2011,3]]},"DOI":"10.1007\/s10898-010-9571-3","type":"journal-article","created":{"date-parts":[[2010,7,7]],"date-time":"2010-07-07T12:33:06Z","timestamp":1278505986000},"page":"449-465","source":"Crossref","is-referenced-by-count":8,"title":["Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering"],"prefix":"10.1007","volume":"49","author":[{"given":"Daniel","family":"Aloise","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,7,8]]},"reference":[{"key":"9571_CR1","doi-asserted-by":"crossref","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. Mach. Learn. 75, 245\u2013248 (2009)","journal-title":"Mach. Learn."},{"key":"9571_CR2","doi-asserted-by":"crossref","unstructured":"Aloise, D., Hansen, P., Liberti, L.: An improved column generation algorithm for minimum sum-of-squares clustering. To appear in Mathematical Programming (2010)","DOI":"10.1007\/s10107-010-0349-7"},{"key":"9571_CR3","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0167-8655(95)00122-0","volume":"17","author":"K.S. Al-Sultan","year":"1996","unstructured":"Al-Sultan K.S., Khan M.M.: Computational experience on four algorithms for the hard clustering problem. Pattern Recognit. Lett. 17, 295\u2013308 (1996)","journal-title":"Pattern Recognit. Lett."},{"key":"9571_CR4","doi-asserted-by":"crossref","unstructured":"Brusco, M.J.: A repetitive branch-and-bound procedure for minimum within-cluster sum of squares partitioning. Psychometrika 71, 347\u2013363","DOI":"10.1007\/s11336-004-1218-1"},{"key":"9571_CR5","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s11336-007-9013-4","volume":"72","author":"M.J. Brusco","year":"2007","unstructured":"Brusco M.J., Steinley D.: A comparison of heuristics procedures for minimum within-cluster sums of squares partitioning. Psychometrika 72, 583\u2013600 (2007)","journal-title":"Psychometrika"},{"key":"9571_CR6","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1137\/S1064827597328327","volume":"21","author":"O. du Merle","year":"2000","unstructured":"du Merle O., Hansen P., Jaumard B., Mladenovi\u0107 N.: An interior point algorithm for minimum sum-of-squares clustering. SIAM J. Sci. Comput. 21, 1485\u20131505 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"9571_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1111\/j.1469-1809.1936.tb02137.x","volume":"VII","author":"R.A. Fisher","year":"1936","unstructured":"Fisher R.A.: The use of multiple measurements in taxonomic problems. Ann. Eugenics. VII, 179\u2013188 (1936)","journal-title":"Ann. Eugenics."},{"key":"9571_CR8","first-page":"768","volume":"21","author":"E.W. Forgy","year":"1965","unstructured":"Forgy E.W.: Cluster analysis of multivariate data: Efficiency vs. interpretability of classifications. Biometrics 21, 768 (1965)","journal-title":"Biometrics"},{"key":"9571_CR9","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. Graham","year":"1972","unstructured":"Graham R.: An efficient algorithm for determining the convex hull of a finite point set. Info. Proc. Lett. 1, 132\u2013133 (1972)","journal-title":"Info. Proc. Lett."},{"key":"9571_CR10","first-page":"191","volume":"79","author":"P. Hansen","year":"1997","unstructured":"Hansen P., Jaumard B.: Cluster analysis and mathematical programming. Math. Program. 79, 191\u2013215 (1997)","journal-title":"Math. Program."},{"key":"9571_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s003579900019","volume":"15","author":"P. Hansen","year":"1998","unstructured":"Hansen P., Jaumard B., Mladenovi\u0107 N.: Minimum sum of squares clustering in a low dimensional space. J. Classifi. 15, 37\u201355 (1998)","journal-title":"J. Classifi."},{"key":"9571_CR12","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P. Hansen","year":"2001","unstructured":"Hansen P., Mladenovi\u0107 N.: J-MEANS: a new local search heuristic for minimum sum of squares clustering. Pattern Recognit. 34, 405\u2013413 (2001)","journal-title":"Pattern Recognit."},{"key":"9571_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00357-005-0018-3","volume":"22","author":"P. Hansen","year":"2005","unstructured":"Hansen P., Ngai E., Cheung B.K., Mladenovi\u0107 N.: Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering. J Classifi. 22, 287\u2013310 (2005)","journal-title":"J Classifi."},{"key":"9571_CR14","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan J.A.: Clustering Algorithms. Wiley, New York (1975)"},{"key":"9571_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"L. Kaufman","year":"1990","unstructured":"Kaufman L., Rousseeuw P.J.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, New York (1990)"},{"key":"9571_CR16","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/S0031-3203(02)00060-2","volume":"36","author":"A. Likas","year":"2003","unstructured":"Likas A., Vlassis N., Verbeek J.: The global k-means clustering algorithm. Pattern Recognit. 36, 451\u2013461 (2003)","journal-title":"Pattern Recognit."},{"key":"9571_CR17","doi-asserted-by":"crossref","unstructured":"MacQueen, J.B.: Some methods for classification and analysis of multivariate observations. In: Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability 2. Berkeley, CA, pp. 281\u2013297 (1967)","DOI":"10.1080\/00401706.1963.10490088"},{"key":"9571_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0457-9","volume-title":"Mathematical Classification and Clustering","author":"B. Mirkin","year":"1996","unstructured":"Mirkin B.: Mathematical Classification and Clustering. Kluwer, Dordrecht, The Netherlands (1996)"},{"key":"9571_CR19","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0377-2217(02)00073-5","volume":"140","author":"F. Plastria","year":"2002","unstructured":"Plastria F.: Formulating logical implications in combinatorial optimisation. Eur. J. Oper. Res. 140, 338\u2013353 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9571_CR20","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","volume":"66","author":"M.R. Rao","year":"1971","unstructured":"Rao M.R.: Cluster analysis and mathematical programming. J. Amer. Statist. Assoc. 66, 622\u2013626 (1971)","journal-title":"J. Amer. Statist. Assoc."},{"key":"9571_CR21","first-page":"479","volume-title":"Handbook of Combinatorial Optimization 1","author":"H.D. Sherali","year":"1999","unstructured":"Sherali H.D., Adams W.P.: Reformulation-linearization techniques for discrete optimization problems. In: Du, D.Z., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization 1., pp. 479\u2013532. Kluwer, Dordrecht (1999)"},{"key":"9571_CR22","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10898-004-2706-7","volume":"32","author":"H.D. Sherali","year":"2005","unstructured":"Sherali H.D., Desai J.: A global optimization RLT-based approach for solving the hard clustering problem. J. Global Optim. 32, 281\u2013306 (2005)","journal-title":"J. Global Optim."},{"key":"9571_CR23","doi-asserted-by":"crossref","unstructured":"Sherali, H.D.: E-mail of 19\/11\/2007","DOI":"10.1287\/ijoc.1050.0158"},{"key":"9571_CR24","unstructured":"Sherali, H.D.: E-mail of 11\/03\/2008"},{"key":"9571_CR25","volume-title":"Cluster analysis algorithms for data reduction and classification of objects","author":"H. Sp\u00e4th","year":"1980","unstructured":"Sp\u00e4th H.: Cluster analysis algorithms for data reduction and classification of objects. Wiley, New York (1980)"},{"key":"9571_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1348\/000711005X48266","volume":"59","author":"D. Steinley","year":"2006","unstructured":"Steinley D.: K-means clustering: A half-century synthesis. Br. J. Math. Stat. Psychol. 59, 1\u201334 (2006)","journal-title":"Br. J. Math. Stat. Psychol."},{"key":"9571_CR27","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1080\/01621459.1969.10500990","volume":"64","author":"H.D. Vinod","year":"1969","unstructured":"Vinod H.D.: Integer programming and the theory of grouping. J. Amer. Statist. Assoc. 64, 506\u2013519 (1969)","journal-title":"J. Amer. Statist. Assoc."},{"key":"9571_CR28","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"J.H. Ward Jr.","year":"1963","unstructured":"Ward J.H. Jr.: Hierarchical grouping to optimize an objective function. J. Amer. Statist. Assoc. 58, 236\u2013244 (1963)","journal-title":"J. Amer. Statist. Assoc."},{"key":"9571_CR29","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey L.A.: Integer Programming. Wiley, New York (1998)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9571-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9571-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9571-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:58:56Z","timestamp":1559278736000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9571-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,8]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["9571"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9571-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,8]]}}}