{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T11:26:03Z","timestamp":1695986763278},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2012,7,29]],"date-time":"2012-07-29T00:00:00Z","timestamp":1343520000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10100-012-0258-3","type":"journal-article","created":{"date-parts":[[2012,7,28]],"date-time":"2012-07-28T12:08:31Z","timestamp":1343477311000},"page":"95-115","source":"Crossref","is-referenced-by-count":6,"title":["Sequential clustering with radius and split criteria"],"prefix":"10.1007","volume":"21","author":[{"given":"Nenad","family":"Mladenovic","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[]},{"given":"Jack","family":"Brimberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,29]]},"reference":[{"key":"258_CR1","doi-asserted-by":"crossref","unstructured":"Batagelj V, Ferligoj A (1990) Agglomerative Hierarchical Multicriteria clustering using decision rules. In: COMPSTAT 1990. Physica Verlag, Heidelberg, pp 15\u201320","DOI":"10.1007\/978-3-642-50096-1_3"},{"key":"258_CR2","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 (2011) Sum-of-squares clustering on networks. Yugosl J Oper Res 21: 157\u2013161","journal-title":"Yugosl J Oper Res"},{"key":"258_CR3","doi-asserted-by":"crossref","unstructured":"Chang MS, Tang CY, Lee RCT (1991) A unified approach for solving bottleneck k-bipartition problems. Proceedings of the 19th annual computer science conference, San Antonio, TX, 5\u20137 March 1991, ACM, pp 39\u201347","DOI":"10.1145\/327164.327202"},{"issue":"4","key":"258_CR4","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1109\/TPAMI.1980.4767027","volume":"PAMI-2","author":"M Delattre","year":"1980","unstructured":"Delattre M, Hansen P (1980) Bicriterion cluster analysis. IEEE Trans Pattern Anal Mach Intell PAMI-2(4): 277\u2013291","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"4","key":"258_CR5","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1137\/S1064827597328327","volume":"21","author":"O Du Merle","year":"1999","unstructured":"Du Merle O, Hansen P, Jaumard B, Mladenovi\u0107 N (1999) An interior point algorithm for minimum sum of squares clustering problem. SIAM J Sci Stat Comput 21(4): 1485\u20131505","journal-title":"SIAM J Sci Stat Comput"},{"issue":"1","key":"258_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02618467","volume":"9","author":"A Ferligoj","year":"1992","unstructured":"Ferligoj A, Batagelj V (1992) Direct multicriteria clustering algorithms. J Classif 9(1): 43\u201361","journal-title":"J Classif"},{"key":"258_CR7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","volume":"486","author":"S Fortunato","year":"2010","unstructured":"Fortunato S (2010) Community detection in graphs. Phys Rep 486: 75\u2013174","journal-title":"Phys Rep"},{"key":"258_CR8","volume-title":"Classification","author":"AD Gordon","year":"1981","unstructured":"Gordon AD (1981) Classification. Chapman and Hall, London"},{"key":"258_CR9","doi-asserted-by":"crossref","first-page":"54","DOI":"10.2307\/2346439","volume":"18","author":"JC Gower","year":"1969","unstructured":"Gower JC, Ross GJS (1969) Minimum spanning trees and single linkage cluster analysis. Appl Stat 18: 54\u201364","journal-title":"Appl Stat"},{"issue":"1","key":"258_CR10","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02616245","volume":"8","author":"A Gu\u00e9noche","year":"1991","unstructured":"Gu\u00e9noche A, Hansen P, Jaumard B (1991) Efficient algorithm for divisive hierarchical clustering with the diameter criterion. J Classif 8(1): 5\u201330","journal-title":"J Classif"},{"key":"258_CR11","volume-title":"Multiple criteria problem solving","author":"P Hansen","year":"1978","unstructured":"Hansen P, Delattre M (1978) Bicriterion cluster analysis as an exploration tool. In: Zionts S (ed) Multiple criteria problem solving. Springer, London"},{"key":"258_CR12","doi-asserted-by":"crossref","unstructured":"Hansen P, Jaumard B (1997) Cluster Analysis and Mathematical Programming, series B, pp 191\u2013215","DOI":"10.1007\/BF02614317"},{"key":"258_CR13","unstructured":"Hansen P, Jaumard B, Mladenovi\u0107 N (1994) How to choose k entities among n. In: Cox I, Hansen P, Julesz B (eds) Partitioning data sets, pp 105\u2013116"},{"key":"258_CR14","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 (1998) Minimum sum of squares clustering in a low dimensional space. J Classif 15: 37\u201356","journal-title":"J Classif"},{"key":"258_CR15","volume-title":"Clustering algorithms","author":"JA Hartigan","year":"1975","unstructured":"Hartigan JA (1975) Clustering algorithms. Wiley, New York"},{"key":"258_CR16","volume-title":"Algorithms for clustering data","author":"AK Jain","year":"1988","unstructured":"Jain AK, Dubes RC (1988) Algorithms for clustering data. Prentice Hall, Englewood Cliffs"},{"key":"258_CR17","volume-title":"Finding groups in data: an introduction to cluster analysis","author":"L Kaufman","year":"2005","unstructured":"Kaufman L, Rousseeuw PJ (2005) Finding groups in data: an introduction to cluster analysis. Wiley, New York"},{"key":"258_CR18","doi-asserted-by":"crossref","unstructured":"Mirkin B (1987) Additive clustering and qualitative factor analysis methods for similarity matrices. J Classif 4:7\u201331 (Erratum 6, 271\u2013272)","DOI":"10.1007\/BF01890073"},{"key":"258_CR19","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 (1996) Mathematical classification and clustering. Kluwer, Dordrecht"},{"key":"258_CR20","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"JC Prim","year":"1957","unstructured":"Prim JC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36: 1389\u20131401","journal-title":"Bell Syst Tech J"},{"key":"258_CR21","volume-title":"Cluster analysis for researchers","author":"HC Romesburg","year":"2004","unstructured":"Romesburg HC (2004) Cluster analysis for researchers. Lulu Press, North Carolina"},{"key":"258_CR22","first-page":"357","volume-title":"Th\u00e9orie des Graphes","author":"P Rosenstiehl","year":"1967","unstructured":"Rosenstiehl P (1967) L\u2019arbre minimum d\u2019un graphe. In: Rosentiehl P (ed) Th\u00e9orie des Graphes. Dunod, Paris, pp 357\u2013368"},{"key":"258_CR23","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0020-0255(70)80056-1","volume":"2","author":"EH Ruspini","year":"1970","unstructured":"Ruspini EH (1970) Numerical methods for fuzzy clustering. Inf Sci 2: 319\u2013350","journal-title":"Inf Sci"},{"key":"258_CR24","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1037\/0033-295X.86.2.87","volume":"86","author":"N Shepard","year":"1979","unstructured":"Shepard N, Arabie P (1979) Additive clustering representation of similarities as combinations of discrete overlapping properties. Psychol Rev 86: 87\u2013133","journal-title":"Psychol Rev"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-012-0258-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-012-0258-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-012-0258-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T20:50:03Z","timestamp":1562014203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-012-0258-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,29]]},"references-count":24,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["258"],"URL":"https:\/\/doi.org\/10.1007\/s10100-012-0258-3","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,29]]}}}