{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:24:25Z","timestamp":1762521865435},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,11]],"date-time":"2015-12-11T00:00:00Z","timestamp":1449792000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"RSF","award":["14-41-00039","14-41-00039"],"award-info":[{"award-number":["14-41-00039","14-41-00039"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s11590-015-0974-4","type":"journal-article","created":{"date-parts":[[2015,12,11]],"date-time":"2015-12-11T11:32:35Z","timestamp":1449833555000},"page":"359-376","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["J-means and I-means for minimum sum-of-squares clustering on networks"],"prefix":"10.1007","volume":"11","author":[{"given":"Alexey","family":"Nikolaev","sequence":"first","affiliation":[]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[]},{"given":"Raca","family":"Todosijevi\u0107","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,11]]},"reference":[{"key":"974_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":"974_CR2","doi-asserted-by":"crossref","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. Math. Program. 131, 195\u2013220 (2012)","journal-title":"Math. Program."},{"key":"974_CR3","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1016\/0377-2217(85)90040-2","volume":"21","author":"JE Beasley","year":"1985","unstructured":"Beasley, J.E.: A note on solving large p-median problems. Eur. J. Oper. Res. 21, 270\u2013273 (1985)","journal-title":"Eur. J. Oper. Res."},{"key":"974_CR4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s101070050054","volume":"85","author":"J Brimberg","year":"1999","unstructured":"Brimberg, J., Mladenovi\u0107, N.: Degeneracy in the multi-source Weber problem. Math. Program. 85, 213\u2013220 (1999)","journal-title":"Math. Program."},{"key":"974_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.2298\/YJOR1102157C","volume":"21","author":"E Carrizosa","year":"2011","unstructured":"Carrizosa, E., Mladenovi\u0107, N., Todosijevi\u0107, R.: Sum-of-squares clustering on networks. Yugosl. J. Oper. Res. 21, 157\u2013161 (2011)","journal-title":"Yugosl. J. Oper. Res."},{"key":"974_CR6","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.ejor.2013.04.027","volume":"230","author":"E Carrizosa","year":"2013","unstructured":"Carrizosa, E., Mladenovi\u0107, N., Todosijevi\u0107, R.: Variable neighborhood search for minimum sum-of-squares clustering on networks. Eur. J. Oper. Res. 230, 356\u2013363 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"974_CR7","doi-asserted-by":"crossref","unstructured":"Carrizosa, E., Alguwaizani, A., Hansen, P., Mladenovi\u0107, N.: New heuristic for harmonic means clustering. J. Global Optim. 1\u201317 (2015)","DOI":"10.1007\/s10898-014-0175-1"},{"key":"974_CR8","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":"974_CR9","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":"974_CR10","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., 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":"974_CR11","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno-P\u00e9rez, J.A.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"974_CR12","volume-title":"Clustering Algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan, J.A.: Clustering Algorithms. Wiley, New York (1975)"},{"key":"974_CR13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/opre.39.1.100","volume":"39","author":"JN Hooker","year":"1991","unstructured":"Hooker, J.N., Garfinkel, R.S., Chen, C.K.: Finite dominating sets for network location problems. Oper. Res. 39, 100\u2013118 (1991)","journal-title":"Oper. Res."},{"key":"974_CR14","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. Computers Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Computers Oper. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0974-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0974-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0974-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0974-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:43Z","timestamp":1559409103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0974-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,11]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["974"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0974-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,11]]}}}