{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T02:35:50Z","timestamp":1773455750393,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,3,19]],"date-time":"2014-03-19T00:00:00Z","timestamp":1395187200000},"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":[[2015,2]]},"DOI":"10.1007\/s10898-014-0171-5","type":"journal-article","created":{"date-parts":[[2014,3,18]],"date-time":"2014-03-18T19:51:46Z","timestamp":1395172306000},"page":"341-361","source":"Crossref","is-referenced-by-count":44,"title":["A heuristic algorithm for solving the minimum sum-of-squares clustering problems"],"prefix":"10.1007","volume":"61","author":[{"given":"Burak","family":"Ordin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adil M.","family":"Bagirov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,19]]},"reference":[{"issue":"9","key":"171_CR1","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1016\/0031-3203(95)00022-R","volume":"28","author":"KS Al-Sultan","year":"1995","unstructured":"Al-Sultan, K.S.: A tabu search approach to the clustering problem. Pattern Recognit. 28(9), 1443\u20131451 (1995)","journal-title":"Pattern Recognit."},{"key":"171_CR2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0167-8655(95)00122-0","volume":"17","author":"KS 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."},{"issue":"2","key":"171_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1023\/A:1020911318981","volume":"3","author":"AM Bagirov","year":"2002","unstructured":"Bagirov, A.M., Rubinov, A.M., Yearwood, J.: A global optimisation approach to classification. Optim. Eng. 3(2), 129\u2013155 (2002)","journal-title":"Optim. Eng."},{"issue":"1","key":"171_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02578945","volume":"11","author":"AM Bagirov","year":"2003","unstructured":"Bagirov, A.M., Rubinov, A.M., Soukhoroukova, N.V., Yearwood, J.: Supervised and unsupervised data classification via nonsmooth and global optimization. TOP: Span. Oper. Res. J. 11(1), 1\u201393 (2003)","journal-title":"TOP: Span. Oper. Res. J."},{"issue":"4\u20135","key":"171_CR5","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1080\/02331930500096155","volume":"54","author":"AM Bagirov","year":"2005","unstructured":"Bagirov, A.M., Ugon, J.: An algorithm for minimizing clustering functions. Optimization 54(4\u20135), 351\u2013368 (2005)","journal-title":"Optimization"},{"key":"171_CR6","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.ejor.2004.06.014","volume":"170","author":"AM Bagirov","year":"2006","unstructured":"Bagirov, A.M., Yearwood, J.: A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems. Eur. J. Oper. Res. 170, 578\u2013596 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"10","key":"171_CR7","doi-asserted-by":"crossref","first-page":"3192","DOI":"10.1016\/j.patcog.2008.04.004","volume":"41","author":"AM Bagirov","year":"2008","unstructured":"Bagirov, A.M.: Modified global $$k$$ k -means algorithm for sum-of-squares clustering problems. Pattern Recognit. 41(10), 3192\u20133199 (2008)","journal-title":"Pattern Recognit."},{"key":"171_CR8","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1016\/j.patcog.2010.10.018","volume":"44","author":"AM Bagirov","year":"2011","unstructured":"Bagirov, A.M., Ugon, J., Webb, D.: Fast modified global $$k$$ k -means algorithm for sum-of-squares clustering problems. Pattern Recognit. 44, 866\u2013876 (2011)","journal-title":"Pattern Recognit."},{"key":"171_CR9","unstructured":"Blake, C., Keogh, E., Merz, C.J.: UCI Repository of Machine Learning Databases [ http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html ]. Irvine, CA: University of California, Department of Information and Computer Science (1998)"},{"key":"171_CR10","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-3-642-72253-0_37","volume-title":"Advances in Data Science and Classification","author":"HH Bock","year":"1998","unstructured":"Bock, H.H.: Clustering and neural networks. In: Rizzi, A., Vichi, M., Bock, H.H. (eds.) Advances in Data Science and Classification, pp. 265\u2013277. Springer, Berlin (1998)"},{"key":"171_CR11","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0031-3203(92)90088-Z","volume":"25","author":"DE Brown","year":"1992","unstructured":"Brown, D.E., Entail, C.E.: A practical application of simulated annealing to the clustering problem. Pattern Recognit. 25, 401\u2013412 (1992)","journal-title":"Pattern Recognit."},{"key":"171_CR12","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1983","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley-Interscience, New York (1983)"},{"issue":"1","key":"171_CR13","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1014075113874","volume":"23","author":"VF Demyanov","year":"2002","unstructured":"Demyanov, V.F., Bagirov, A.M., Rubinov, A.M.: A method of truncated codifferential with application to some problems of cluster analysis. J. Glob. Optim. 23(1), 63\u201380 (2002)","journal-title":"J. Glob. Optim."},{"key":"171_CR14","doi-asserted-by":"crossref","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 J. Sci. Stat. Comput. 6, 268\u2013284 (1985)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"171_CR15","unstructured":"du Merle, O., Hansen, P., Jaumard, B., Mladenovic, N.: An interior point method for minimum sum-of-squares clustering. SIAM J. Sci. Comput. 21, 1485\u20131505 (2001)"},{"key":"171_CR16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0031-3203(76)90045-5","volume":"8","author":"R Dubes","year":"1976","unstructured":"Dubes, R., Jain, A.K.: Clustering techniques: the user\u2019s dilemma. Pattern Recognit. 8, 247\u2013260 (1976)","journal-title":"Pattern Recognit."},{"key":"171_CR17","doi-asserted-by":"crossref","unstructured":"Fisher, R.A.: The use of multiple measurements in taxonomic problems, Ann. Eugenics, VII part II (1936) pp. 179\u2013188. Reprinted. In: Fisher R.A. Contributions to Mathematical Statistics. Wiley (1950)","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"key":"171_CR18","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(85)90012-8","volume":"20","author":"P Hanjoul","year":"1985","unstructured":"Hanjoul, P., Peeters, D.: A comparison of two dual-based procedures for solving the $$p$$ p -median problem. Eur. J. Oper. Res. 20, 387\u2013396 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"171_CR19","first-page":"191","volume":"79","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Jaumard, B.: Cluster analysis and mathematical programming. Math. Program. 79(1\u20133), 191\u2013215 (1997)","journal-title":"Math. Program."},{"key":"171_CR20","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"4","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: $$J$$ J -means: a new heuristic for minimum sum-of-squares clustering. Pattern Recognit. 4, 405\u2013413 (2001)","journal-title":"Pattern Recognit."},{"key":"171_CR21","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood decomposition search. J. Heuristics 7, 335\u2013350 (2001)","journal-title":"J. Heuristics"},{"issue":"2","key":"171_CR22","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., Mladenovic, N.: Analysis of global $$k$$ k -means, an incremental heuristic for minimum sum-of-squares clustering. J. Classif. 22(2), 287\u2013310 (2005)","journal-title":"J. Classif."},{"key":"171_CR23","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/T-C.1975.224336","volume":"24","author":"WLG Koontz","year":"1975","unstructured":"Koontz, W.L.G., Narendra, P.M., Fukunaga, K.: A branch and bound clustering algorithm. IEEE Trans. Comput. 24, 908\u2013915 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"171_CR24","doi-asserted-by":"crossref","unstructured":"Lai, J.Z.C., Huang, T.-J.: Fast global k-means clustering using cluster membership and inequality. Pattern Recognit. 43(3), 731-737 (2010)","DOI":"10.1016\/j.patcog.2009.11.021"},{"key":"171_CR25","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, M., Verbeek, J.: The global $$k$$ k -means clustering algorithm. Pattern Recognit. 36, 451\u2013461 (2003)","journal-title":"Pattern Recognit."},{"key":"171_CR26","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSP-LIB-A Traveling salesman library. ORSA J. Comput. 3, 319\u2013350 (1991)","journal-title":"ORSA J. Comput."},{"key":"171_CR27","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"issue":"10","key":"171_CR28","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1016\/0031-3203(91)90097-O","volume":"24","author":"SZ Selim","year":"1991","unstructured":"Selim, S.Z., Al-Sultan, K.S.: A simulated annealing algorithm for the clustering. Pattern Recognit. 24(10), 1003\u20131008 (1991)","journal-title":"Pattern Recognit."},{"key":"171_CR29","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/s10898-004-2706-7","volume":"32","author":"HD Sherali","year":"2005","unstructured":"Sherali, H.D., Desai, J.: A global optimization RLT-based approach for solving the hard clustering problem. J. Glob. Optim. 32, 281\u2013306 (2005)","journal-title":"J. Glob. Optim."},{"key":"171_CR30","volume-title":"Cluster Analysis Algorithms","author":"H Spath","year":"1980","unstructured":"Spath, H.: Cluster Analysis Algorithms. Ellis Horwood Limited, Chichester (1980)"},{"key":"171_CR31","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0097-8485(94)85003-8","volume":"18","author":"LX Sun","year":"1994","unstructured":"Sun, L.X., Xie, Y.L., Song, X.H., Wang, J.H., Yu, R.Q.: Cluster analysis by simulated annealing. Comput. Chem. 18, 103\u2013108 (1994)","journal-title":"Comput. Chem."},{"issue":"3","key":"171_CR32","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10898-007-9140-6","volume":"39","author":"MP Tan","year":"2007","unstructured":"Tan, M.P., Broach, J.R., Floudas, C.A.: A novel clustering approach and prediction of optimal number of clusters: global optimum search with enhanced positioning. J. Glob. Optim. 39(3), 323\u2013346 (2007)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"171_CR33","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/j.patcog.2009.06.018","volume":"43","author":"AE Xavier","year":"2010","unstructured":"Xavier, A.E.: The hyperbolic smoothing clustering method. Pattern Recognit. 43(3), 731\u2013737 (2010)","journal-title":"Pattern Recognit."},{"issue":"1","key":"171_CR34","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.patcog.2010.07.004","volume":"44","author":"AE Xavier","year":"2011","unstructured":"Xavier, A.E., Xavier, V.L.: Solving the minimum sum-of-squares clustering problem by hyperbolic smoothing and partition into boundary and gravitational regions. Pattern Recognit. 44(1), 70\u201377 (2011)","journal-title":"Pattern Recognit."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0171-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0171-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0171-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T16:02:16Z","timestamp":1565280136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0171-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,19]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["171"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0171-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,19]]}}}