{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T11:37:44Z","timestamp":1762429064300},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1994,2,1]],"date-time":"1994-02-01T00:00:00Z","timestamp":760060800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,2]]},"DOI":"10.1007\/bf01182769","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T18:59:51Z","timestamp":1108666791000},"page":"93-103","source":"Crossref","is-referenced-by-count":8,"title":["Dynamic programming and convex clustering"],"prefix":"10.1007","volume":"11","author":[{"given":"Vladimir","family":"Batagelj","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simona","family":"Korenjak-\u010cerne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01182769_CR1","unstructured":"V. Batagelj, Optimal clusterings, Paper presented at the Fourth European Meeting of the Psychometric Society and the Classification Societies, Cambridge, 2\u20135 July 1985, Unpublished manuscript."},{"key":"BF01182769_CR2","first-page":"31","volume":"2","author":"P. Bertrand","year":"1985","unstructured":"P. Bertrand and E. Diday, A visual representation of the compatibility between an order and a dissimilarity index: the pyramids,Comput. Statist. Quart.,2 (1985), 31\u201342.","journal-title":"Comput. Statist. Quart."},{"key":"BF01182769_CR3","series-title":"Lecture Notes in Economics and Mathematical Systems, Vol. 175","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/978-3-642-95322-4_5","volume-title":"Optimization and Operations Research","author":"P. Brucker","year":"1978","unstructured":"P. Brucker, On the complexity of clustering problems, inOptimization and Operations Research (R. Henn, B. Korte and W. Oettli, eds.), Lecture Notes in Economics and Mathematical Systems, Vol. 175, Springer-Verlag, Berlin, 1978, pp. 45\u201354."},{"key":"BF01182769_CR4","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF02293706","volume":"47","author":"A Ferligoj","year":"1982","unstructured":"A Ferligoj and V. Batagelj, Clustering with relational constraint,Psychometrika,47 (1982), 413\u2013426.","journal-title":"Psychometrika"},{"key":"BF01182769_CR5","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1080\/01621459.1958.10501479","volume":"53","author":"W. D. Fisher","year":"1958","unstructured":"W. D. Fisher, On grouping for maximum homogeneity,J. Amer. Statist. Assoc.,53 (1958), 789\u2013798.","journal-title":"J. Amer. Statist. Assoc."},{"key":"BF01182769_CR6","volume-title":"Classification","author":"A. D. Gordon","year":"1981","unstructured":"A. D. Gordon,Classification, Chapman & Hall, London, 1981."},{"key":"BF01182769_CR7","doi-asserted-by":"crossref","unstructured":"D. J. Hand, Branch and bound in statistical data analysis, Manuscript, 1981.","DOI":"10.2307\/2987699"},{"key":"BF01182769_CR8","volume-title":"Clustering Algorithms","author":"J. A. Hartigan","year":"1975","unstructured":"J. A. Hartigan,Clustering Algorithms, Wiley, New York, 1975."},{"key":"BF01182769_CR9","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1137\/0606015","volume":"6","author":"F. K. Hwang","year":"1985","unstructured":"F. K. Hwang, J. Sun, and E. Y. Yao, Optimal set partitioning,SIAM J. Algebraic Discrete Methods,6 (1985), 163\u2013170.","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"BF01182769_CR10","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1287\/opre.17.6.1034","volume":"17","author":"R. E. Jensen","year":"1969","unstructured":"R. E. Jensen, A dynamic programming algorithm for cluster analysis,Oper. Res.,17 (1969), 1034\u20131057.","journal-title":"Oper. Res."},{"key":"BF01182769_CR11","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","volume":"66","author":"M. R. Rao","year":"1971","unstructured":"M. R. Rao, Cluster analysis and mathematical programming,J. Amer. Statist. Assoc.,66 (1971), 622\u2013626.","journal-title":"J. Amer. Statist. Assoc."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01182769.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01182769\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01182769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:27:52Z","timestamp":1586118472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01182769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,2]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,2]]}},"alternative-id":["BF01182769"],"URL":"https:\/\/doi.org\/10.1007\/bf01182769","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,2]]}}}