{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T04:55:47Z","timestamp":1775624147140,"version":"3.50.1"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,4,20]],"date-time":"2010-04-20T00:00:00Z","timestamp":1271721600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s10107-010-0349-7","type":"journal-article","created":{"date-parts":[[2010,4,19]],"date-time":"2010-04-19T05:43:03Z","timestamp":1271655783000},"page":"195-220","source":"Crossref","is-referenced-by-count":77,"title":["An improved column generation algorithm for minimum sum-of-squares clustering"],"prefix":"10.1007","volume":"131","author":[{"given":"Daniel","family":"Aloise","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,20]]},"reference":[{"key":"349_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\u2013249 (2009)","journal-title":"Mach. Learn."},{"key":"349_CR2","doi-asserted-by":"crossref","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 29, 503\u2013516 (2009)","journal-title":"Pesquisa Operacional"},{"key":"349_CR3","doi-asserted-by":"crossref","unstructured":"Aloise, D., Hansen, P.: Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering. To appear in J. Glob. Optim. (2010)","DOI":"10.1007\/s10898-010-9571-3"},{"key":"349_CR4","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s10898-006-9066-4","volume":"37","author":"L.T. An","year":"2007","unstructured":"An L.T., Belghiti M.T., Tao P.D.: A new efficient algorithm based on DC programming and DCA for clustering. J. Glob. Optim. 37, 593\u2013608 (2007)","journal-title":"J. Glob. Optim."},{"key":"349_CR5","unstructured":"Asuncion, A., Newman, D.J.: UCI machine learning repository. http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html . (2007)"},{"key":"349_CR6","doi-asserted-by":"crossref","first-page":"3192","DOI":"10.1016\/j.patcog.2008.04.004","volume":"41","author":"A.M. Bagirov","year":"2008","unstructured":"Bagirov A.M.: Modified global k-means algorithm for minimum sum-of-squares clustering problems. Pattern Recognit. 41, 3192\u20133199 (2008)","journal-title":"Pattern Recognit."},{"key":"349_CR7","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.ejor.2004.06.014","volume":"170","author":"A.M. Bagirov","year":"2006","unstructured":"Bagirov A.M., Yearwoord J.: Hierarchical grouping to optimize an objective function. Eur. J. Oper. Res. 170, 578\u2013596 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"349_CR8","unstructured":"Bonami, P., Lee, J.: BONMIN user\u2019s manual. Technical report, IBM Corporation, June (2007)"},{"key":"349_CR9","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s11336-004-1218-1","volume":"71","author":"M.J. Brusco","year":"2006","unstructured":"Brusco M.J.: A repetitive branch-and-bound procedure for minimum within-cluster sum of squares partitioning. Psychometrika 71, 347\u2013363 (2006)","journal-title":"Psychometrika"},{"key":"349_CR10","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":"349_CR11","doi-asserted-by":"crossref","unstructured":"Christou, I.T.: Exact method-based coordination of cluster ensembles. To appear in IEEE Trans. Pattern Anal. Mach. Intell. (2010)","DOI":"10.1109\/TPAMI.2010.85"},{"key":"349_CR12","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":"349_CR13","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W. Dinkelbach","year":"1967","unstructured":"Dinkelbach W.: On nonlinear fractional programming. Manage Sci 13, 492\u2013498 (1967)","journal-title":"Manage Sci"},{"key":"349_CR14","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/trsc.25.3.183","volume":"25","author":"Z. Drezner","year":"1991","unstructured":"Drezner Z., Mehrez A., Wesolowsky G.O.: The facility location problem with limited distances. Transp. Sci. 25, 183\u2013187 (1991)","journal-title":"Transp. Sci."},{"key":"349_CR15","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1137\/S1064827597328327","volume":"21","author":"O. Merle du","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":"349_CR16","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O. Merle du","year":"1999","unstructured":"du Merle O., Villeneuve D., Desrosiers J., Hansen P.: Stabilized column generation. Discrete Math. 194, 229\u2013237 (1999)","journal-title":"Discrete Math."},{"key":"349_CR17","doi-asserted-by":"crossref","first-page":"362","DOI":"10.2307\/2528096","volume":"21","author":"A.W. Edwards","year":"1965","unstructured":"Edwards A.W., Cavalli-Sforza L.L.: A method for cluster analysis. Biometrics 21, 362\u2013375 (1965)","journal-title":"Biometrics"},{"key":"349_CR18","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/s10107-003-0469-4","volume":"100","author":"S. Elhedhli","year":"2004","unstructured":"Elhedhli S., Goffin J.-L.: The integration of an interior-point cutting plane method within a branch-and-price algorithm. Math. Program. 100, 267\u2013294 (2004)","journal-title":"Math. Program."},{"key":"349_CR19","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. Eugen. VII, 179\u2013188 (1936)","journal-title":"Ann. Eugen."},{"key":"349_CR20","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":"349_CR21","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38","author":"J.-L. Goffin","year":"1992","unstructured":"Goffin J.-L., Haurie A., Vial J.-P.: Decomposition and nondifferentiable optimization with the projective algorithm. Manag. Sci. 38, 284\u2013302 (1992)","journal-title":"Manag. Sci."},{"key":"349_CR22","unstructured":"Gr\u00f6tschel, M., Holland, O.: Solution of large-scale symmetric traveling salesman problems. Math. Program. 51, 141\u2013202 (1991). Data sets available at http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/tsp"},{"key":"349_CR23","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":"349_CR24","unstructured":"Hansen, P., Jaumard, B., Meyer, C.: A simple enumerative algorithm for unconstrained 0\u20131 quadratic programming. Cahier du GERAD G-2000-59, GERAD, November (2000)"},{"key":"349_CR25","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":"349_CR26","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen P., Mladenovi\u0107 N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"349_CR27","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10288-008-0089-1","volume":"6","author":"P. Hansen","year":"2008","unstructured":"Hansen P., Mladenovi\u0107 N., P\u00e9rez J.A.M.: Variable neighborhood search: methods and applications. 4OR 6, 319\u2013360 (2008)","journal-title":"4OR"},{"key":"349_CR28","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s00357-005-0018-3","volume":"22","author":"P. Hansen","year":"2005","unstructured":"Hansen P., Negai E., Cheung B.K., Mladenovi\u0107 N.: Analysis of global k-means, an incremental heuristic for minimum sum-of-squares clustering. J. Classif. 22, 287\u2013310 (2005)","journal-title":"J. Classif."},{"key":"349_CR29","volume-title":"Clustering Algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan J.A.: Clustering Algorithms. Wiley, New York (1975)"},{"key":"349_CR30","doi-asserted-by":"crossref","unstructured":"Heinz, G., Peterson, L.J., Johnson, R.W., Kerk, C.J.: Exploring relationships in body dimensions. J. Stat. Education 11, (2003) Data set available at http:\/\/www.amstat.org\/publications\/jse\/v11n2\/datasets.heinz.html","DOI":"10.1080\/10691898.2003.11910711"},{"key":"349_CR31","doi-asserted-by":"crossref","unstructured":"Inaba, M., Katoh, N., Imai, H.: Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering. In: Proceedings of the 10th ACM Symposium on Computational Geometry, pp. 332\u2013339 (1994)","DOI":"10.1145\/177424.178042"},{"key":"349_CR32","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","volume":"31","author":"A.K. Jain","year":"1999","unstructured":"Jain A.K., Murty M.N., Flynn P.J.: Data clustering: a review. ACM Comput. Surv. 31, 264\u2013323 (1999)","journal-title":"ACM Comput. Surv."},{"key":"349_CR33","doi-asserted-by":"crossref","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. Oper. Res. 17, 1034\u20131057 (1969)","journal-title":"Oper. Res."},{"key":"349_CR34","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley J.E.: The cutting plane method for solving convex programs. J. SIAM 8, 703\u2013712 (1960)","journal-title":"J. SIAM"},{"key":"349_CR35","volume-title":"Introduction to Clustering Large and High-Dimensional Data","author":"J. Kogan","year":"2006","unstructured":"Kogan J.: Introduction to Clustering Large and High-Dimensional Data. Cambridge University Press, New York (2006)"},{"key":"349_CR36","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/T-C.1975.224336","volume":"C-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. C-24, 908\u2013915 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"349_CR37","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TPAMI.2006.66","volume":"28","author":"M. Laszlo","year":"2006","unstructured":"Laszlo M., Mukherjee S.: A genetic algorithm using hyper-quadtrees for low-dimensional k-means clustering. IEEE Trans. Pattern Anal. Mach. Intell. 28, 533\u2013543 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"349_CR38","first-page":"451","volume":"36","author":"M. Laszlo","year":"2007","unstructured":"Laszlo M., Mukherjee S.: A genetic algorithm that exchanges neighboring centers for k-means clustering. Pattern Recognit. Lett. 36, 451\u2013461 (2007)","journal-title":"Pattern Recognit. Lett."},{"key":"349_CR39","unstructured":"Leyffer, S.: User manual for MINLP_BB. Technical report, University of Dundee, UK, March (1999)"},{"issue":"1","key":"349_CR40","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1051\/ro\/2009005","volume":"43","author":"L. Liberti","year":"2009","unstructured":"Liberti L.: Reformulations in mathematical programming: definitions and systematics. RAIRO-RO 43(1), 55\u201386 (2009)","journal-title":"RAIRO-RO"},{"key":"349_CR41","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.J.: The global k-means clustering algorithm. Pattern Recognit. 36, 451\u2013461 (2003)","journal-title":"Pattern Recognit."},{"key":"349_CR42","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, vol. 2, pp. 281\u2013297. Berkeley, CA (1967)","DOI":"10.1080\/00401706.1963.10490088"},{"key":"349_CR43","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/978-3-642-00202-1_24","volume":"5431","author":"M. Mahajan","year":"2009","unstructured":"Mahajan M., Nimbhorkar P., Varadarajan K.: The planar k-means problem is NP-hard. Lect. Notes Comput. Sci. 5431, 274\u2013285 (2009)","journal-title":"Lect. Notes Comput. Sci."},{"key":"349_CR44","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1007\/978-3-540-45231-7_27","volume":"2810","author":"P. Merz","year":"2003","unstructured":"Merz P.: An iterated local search for minimum sum-of-squares clustering. Lect. Notes Comput. Sci. 2810, 286\u2013296 (2003)","journal-title":"Lect. Notes Comput. Sci."},{"key":"349_CR45","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":"349_CR46","doi-asserted-by":"crossref","DOI":"10.1201\/9781420034912","volume-title":"Clustering for Data Mining: A Data Recovery Approach","author":"B. Mirkin","year":"2005","unstructured":"Mirkin B.: Clustering for Data Mining: A Data Recovery Approach. Chapman and Hall\/CRC, Boca Raton (2005)"},{"key":"349_CR47","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107 N., Hansen P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"349_CR48","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1016\/j.cor.2003.11.006","volume":"32","author":"J.A. Pacheco","year":"2005","unstructured":"Pacheco J.A.: A scatter search approach for the minimum sum-of-squares clustering problem. Comput. Oper. Res. 32, 1325\u20131335 (2005)","journal-title":"Comput. Oper. Res."},{"key":"349_CR49","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/S0167-9473(02)00224-4","volume":"43","author":"J.A. Pacheco","year":"2003","unstructured":"Pacheco J.A., Valencia O.: Design of hybrids for the minimum sum-of-squares clustering problem. Comput. Stat. Data Anal. 43, 235\u2013248 (2003)","journal-title":"Comput. Stat. Data Anal."},{"key":"349_CR50","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33, 60\u2013100 (1991). Data set available at http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/tsp"},{"key":"349_CR51","unstructured":"Pal, S.K., Majumder, D.D.: Fuzzy sets and decision making approaches in vowel and speaker recognition. IEEE Trans. Syst. Man. Cybern. 7, 625\u2013629 (1977). Data set available at http:\/\/www.isical.ac.in\/sushmita\/patterns\/vowel.dat"},{"key":"349_CR52","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/11362197_4","volume":"180","author":"J. Peng","year":"2005","unstructured":"Peng J., Xia Y.: A new theoretical framework for k-means-type clustering. Stud Fuzziness Soft Comput. 180, 79\u201396 (2005)","journal-title":"Stud Fuzziness Soft Comput."},{"key":"349_CR53","unstructured":"Reinelt, G.: TSPLIB\u2013 a traveling salesman library. ORSA J. Comput. 3, 319\u2013350 (1991). http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95"},{"key":"349_CR54","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0020-0255(70)80056-1","volume":"2","author":"E.H. Ruspini","year":"1970","unstructured":"Ruspini E.H.: Numerical method for fuzzy clustering. Inf. Sci. 2, 319\u2013350 (1970)","journal-title":"Inf. Sci."},{"key":"349_CR55","first-page":"269","volume-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","author":"D.M. Ryan","year":"1981","unstructured":"Ryan D.M., Foster B.A.: An integer programming approach to scheduling. In: Wren, A. (eds) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp. 269\u2013280. North-Holland, Amsterdam (1981)"},{"key":"349_CR56","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":"349_CR57","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. Glob. Optim. 32, 281\u2013306 (2005)","journal-title":"J. Glob. Optim."},{"key":"349_CR58","volume-title":"Cluster Analysis Algorithm for Data Reduction and Classification of Objects","author":"H. Sp\u00e4th","year":"1980","unstructured":"Sp\u00e4th H.: Cluster Analysis Algorithm for Data Reduction and Classification of Objects. Wiley, New York (1980)"},{"key":"349_CR59","first-page":"801","volume":"IV","author":"H. Steinhaus","year":"1956","unstructured":"Steinhaus H.: Sur la division des corps mat\u00e8riels en parties. Bulletin De L\u2019Acad\u00e9mie Polonaise Des Sciences Classe III. IV, 801\u2013804 (1956)","journal-title":"Bulletin De L\u2019Acad\u00e9mie Polonaise Des Sciences Classe III."},{"key":"349_CR60","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":"349_CR61","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1021841728075","volume":"9","author":"\u00c9.D. Taillard","year":"2003","unstructured":"Taillard \u00c9.D.: Heuristic methods for large centroid clustering problems. J. Heuristics 9, 51\u201373 (2003)","journal-title":"J. Heuristics"},{"key":"349_CR62","first-page":"65","volume":"8","author":"M. Teboulle","year":"2007","unstructured":"Teboulle M.: A unified continuous optimization framework for center-based clustering methods. J. Mach. Learn. Res. 8, 65\u2013102 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"349_CR63","first-page":"1437","volume":"5","author":"H. Tuy","year":"1964","unstructured":"Tuy H.: Concave programming under linear constraints. Soviet Math. 5, 1437\u20131440 (1964)","journal-title":"Soviet Math."},{"key":"349_CR64","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00357-004-0017-9","volume":"21","author":"B.J. Os van","year":"2004","unstructured":"van Os B.J., Meulman J.J.: Improving dynamic programming strategies for partitioning. J. Classif. 21, 207\u2013230 (2004)","journal-title":"J. Classif."},{"key":"349_CR65","volume-title":"Nonlinear Optimization: Complexity Issues","author":"S.A. Vavasis","year":"1991","unstructured":"Vavasis S.A.: Nonlinear Optimization: Complexity Issues. Oxford University Press, Oxford (1991)"},{"key":"349_CR66","unstructured":"Xavier, A.E., Negreiros, M.J., Maculan, N., Michelon, P.: The use of the hyperbolic smoothing clustering method for planning the tasks of sanitary agents in combating dengue. In: Proceedings of IFORS 2005 (2005)"},{"key":"349_CR67","doi-asserted-by":"crossref","unstructured":"Xia, Y., Peng, J.: A cutting algorithm for the minimum sum-of-squared error clustering. In: Proceedings of the SIAM International Data Mining Conference (2005)","DOI":"10.1137\/1.9781611972757.14"},{"key":"349_CR68","unstructured":"Yeh, I.-C.: Modeling of strength of high performance concrete using artificial neural networks. Cement and Concrete Res. 28, 1797\u20131808 (1998). Data set available at http:\/\/archive.ics.uci.edu\/ml\/datasets\/Concrete+Compressive+Strength"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0349-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-010-0349-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-010-0349-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:50:07Z","timestamp":1559109007000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-010-0349-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,20]]},"references-count":68,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["349"],"URL":"https:\/\/doi.org\/10.1007\/s10107-010-0349-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,20]]}}}