{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:32:47Z","timestamp":1775039567551,"version":"3.50.1"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0031-3203(99)00216-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:01:39Z","timestamp":1027609299000},"page":"405-413","source":"Crossref","is-referenced-by-count":202,"title":["J-Means: a new local search heuristic for minimum sum of squares clustering"],"prefix":"10.1016","volume":"34","author":[{"given":"Pierre","family":"Hansen","sequence":"first","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(99)00216-2_BIB1","doi-asserted-by":"crossref","unstructured":"P. Brucker, On the Complexity of Clustering Problems, Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, Vol. 157, 1978, pp. 45\u201354.","DOI":"10.1007\/978-3-642-95322-4_5"},{"key":"10.1016\/S0031-3203(99)00216-2_BIB2","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0167-7152(86)90016-7","article-title":"Another interpretation of the EM algorithm for mixture distributions","volume":"4","author":"Hathaway","year":"1986","journal-title":"Statist. Probab. Lett."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0167-9473(92)90042-E","article-title":"A classification EM algorithm for clustering and two stochastic versions","volume":"14","author":"Celeux","year":"1992","journal-title":"Comput. Statist. Data. Anal."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB4","unstructured":"O. du Merle, P. Hansen, B. Jaumard, N. Mladenovi\u0107, An interior point algorithm for minimum sum of squares clustering, Les Cahiers du GERAD G-97-53, Montreal, Canada, 1997, SIAM J. Sci. Comput., to appear."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB5","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/T-C.1975.224336","article-title":"A branch and bound clustering algorithm","volume":"C-24","author":"Koontz","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB6","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0906020","article-title":"Evaluation of a branch and bound algorithm for clustering","volume":"6","author":"Diehr","year":"1985","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB7","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","article-title":"Decomposition and nondifferentiable optimization with the projective algorithm","volume":"38","author":"Goffin","year":"1992","journal-title":"Mgmt. Sci."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB8","doi-asserted-by":"crossref","unstructured":"R.A. Fisher, The use of multiple measurements in taxonomic problems, Ann. Eugenics Part II, VII (1936) 179\u2013188.","DOI":"10.1111\/j.1469-1809.1936.tb02137.x"},{"key":"10.1016\/S0031-3203(99)00216-2_BIB9","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1071\/BT9660127","article-title":"Multidimensional group analysis","volume":"14","author":"Jancey","year":"1966","journal-title":"Austral. J. Botany"},{"key":"10.1016\/S0031-3203(99)00216-2_BIB10","unstructured":"J.B. MacQueen, Some methods for classification and analysis of multivariate observations, Proceeding of the 5th Berkeley Symposium on Mathematical Statistics and Probability, Vol. 2, 1967, pp. 281\u2013297."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB11","unstructured":"R. Howard, in: J.R. Lawrence (Ed.), Classifying a population into homogeneous groups, Operational Research in the Social Sciences, Tavistock Publ., London, 1966."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB12","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0031-3203(89)90067-8","article-title":"Experiments in projection and clustering by simulated annealing","volume":"22","author":"Klein","year":"1989","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(99)00216-2_BIB13","doi-asserted-by":"crossref","first-page":"1443","DOI":"10.1016\/0031-3203(95)00022-R","article-title":"A tabu search approach to the clustering problem","volume":"28","author":"Al-Sultan","year":"1995","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(99)00216-2_BIB14","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1016\/0167-8655(93)90058-L","article-title":"A near-optimal initial seed value selection in k-means algorithm, using genetic algorithm","volume":"14","author":"Babu","year":"1993","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB15","unstructured":"N. Mladenovi\u0107, A variable neighborhood algorithm \u2014 a new metaheuristic for combinatorial optimization, Abstracts of papers presented at Optimization Days, Montr\u00e9al, 1995, p. 112."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB16","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighborhood search","volume":"24","author":"Mladenovi\u0107","year":"1997","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB17","doi-asserted-by":"crossref","unstructured":"P. Hansen, N. Mladenovi\u0107, in: S. Voss et al. (Eds.), An introduction to variable neighborhood search, Meta-heuristics advances and trends in local search paradigms for optimization, MIC97, Kluwer, Dordrecht, 1998, pp. 433\u2013458.","DOI":"10.1007\/978-1-4615-5775-3_30"},{"key":"10.1016\/S0031-3203(99)00216-2_BIB18","unstructured":"H. Sp\u00e4th, Cluster Analysis Algorithms for Data Reduction and Classification of Objects, Ellis Horwood, Chichester, 1980."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB19","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.11.3.331","article-title":"Location\u2013allocation problems","volume":"11","author":"Cooper","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB20","first-page":"138","article-title":"On the location of supply points to minimize transportation costs","volume":"12","author":"Maranzana","year":"1964","journal-title":"Oper. Res. Quart."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB21","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s101070050054","article-title":"Degeneracy in the multi-source Weber problem","volume":"85","author":"Brimberg","year":"1999","journal-title":"Math. Programming"},{"key":"10.1016\/S0031-3203(99)00216-2_BIB22","first-page":"95","article-title":"A fast algorithm for the greedy interchange for large-scale clustering and median location problems","volume":"21","author":"Whitaker","year":"1983","journal-title":"Inform."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB23","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","article-title":"Variable neighborhood search for the p-median","volume":"5","author":"Hansen","year":"1997","journal-title":"Location Sci."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB24","unstructured":"J. Brimberg, P. Hansen, N. Mladenovi\u0107, \u00c9. Taillard, Improvements and comparison of heuristics for solving the multisource Weber problem, Les Cahiers du GERAD G-97-37, Montr\u00e9al, Canada 1997, Oper. Res., to appear."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB25","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","article-title":"TSP\u2013LIB\u2013A traveling salesman library","volume":"3","author":"Reinelt","year":"1991","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0031-3203(99)00216-2_BIB26","doi-asserted-by":"crossref","unstructured":"E.B. Baum, Toward practical \u2018neural\u2019 computation for combinatorial optimization problems, in: J. Denker (Ed.), Neural Networks for Computing, American Institute of Physics, 1986.","DOI":"10.1063\/1.36219"},{"key":"10.1016\/S0031-3203(99)00216-2_BIB27","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","article-title":"A new adaptive multi\u2013start technique for combinatorial global optimizations","volume":"16","author":"Boese","year":"1994","journal-title":"Oper. Res. Lett."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320399002162?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320399002162?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T00:08:21Z","timestamp":1578614901000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320399002162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0031320399002162"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(99)00216-2","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}