{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:50:04Z","timestamp":1742971804151,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":16,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387747583"},{"type":"electronic","value":"9780387747590"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-74759-0_145","type":"book-chapter","created":{"date-parts":[[2008,8,25]],"date-time":"2008-08-25T11:05:19Z","timestamp":1219662319000},"page":"837-844","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Programming in Clustering"],"prefix":"10.1007","author":[{"given":"L. J.","family":"Hubert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Arabie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Meulman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"145_CR1_145","doi-asserted-by":"publisher","first-page":"1342","DOI":"10.1109\/43.469661","volume":"14","author":"C.J. Alpert","year":"1995","unstructured":"Alpert CJ, Kahng AB (1995) Multiway partitioning via geometric embeddings, orderings, and dynamic programming. IEEE Trans Computer-Aided Design Integr Circuits and Syst 14:1342\u20131357","journal-title":"IEEE Trans. Computer-Aided Design Integr. Circuits and Syst."},{"key":"145_CR2_145","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/s003579900003","volume":"14","author":"C.J. Alpert","year":"1997","unstructured":"Alpert CJ, Kahng AB (1997) Splitting an ordering into a\u00a0partition to minimize diameter. J\u00a0Class 14:51\u201374","journal-title":"J. Class."},{"key":"145_CR3_145","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/BF01182769","volume":"11","author":"V. Batagelj","year":"1994","unstructured":"Batagelj V, Korenjak-\u010cerne S, Klav\u017ear S (1994) Dynamic programming and convex clustering. Algorithmica 11:93\u2013103","journal-title":"Algorithmica"},{"key":"145_CR4_145","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R. Bellman","year":"1962","unstructured":"Bellman R (1962) Dynamic programming treatment of the traveling salesman problem. J\u00a0ACM 9:61\u201363","journal-title":"J. ACM"},{"key":"145_CR5_145","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.2044-8317.1978.tb00571.x","volume":"31","author":"D. Defays","year":"1978","unstructured":"Defays D (1978) A\u00a0short note on a\u00a0method of seriation. British J Math Statist Psych 31:49\u201353","journal-title":"British J. Math. Statist. Psych."},{"key":"145_CR6_145","doi-asserted-by":"publisher","first-page":"789","DOI":"10.2307\/2281952","volume":"53","author":"W.D. Fisher","year":"1958","unstructured":"Fisher WD (1958) On grouping for maximum heterogeneity. J\u00a0Amer Statist Assoc 53:789\u2013798","journal-title":"J. Amer. Statist. Assoc."},{"key":"145_CR7_145","first-page":"191","volume":"79","author":"P. Hansen","year":"1997","unstructured":"Hansen P, Jaumard B (1997) Cluster analysis and mathematical programming. Math Program 79:191\u2013215","journal-title":"Math. Program."},{"key":"145_CR8_145","volume-title":"Clustering algorithms","author":"J.A. Hartigan","year":"1975","unstructured":"Hartigan JA (1975) Clustering algorithms. Wiley, New York"},{"key":"145_CR9_145","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"Held M, Karp RM (1962) A\u00a0dynamic programming approach to sequencing problems. J\u00a0Soc Indus Appl Math 10:196\u2013210","journal-title":"J. Soc. Indus. Appl. Math."},{"key":"145_CR10_145","series-title":"DIMACS","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1090\/dimacs\/037\/21","volume-title":"Mathematical hierarchies and biology","author":"L.J. Hubert","year":"1997","unstructured":"Hubert LJ, Arabie P, Meulman J (1997) The construction of globally optimal ordered partitions. In: Mirkin B, McMorris FR, Roberts FS, Rzhetsky A (eds) Mathematical hierarchies and biology. DIMACS, Amer. Math. Soc., Providence, RI, pp\u00a0299\u2013312"},{"key":"145_CR11_145","series-title":"Lecture Notes","first-page":"457","volume-title":"L 1-statistical procedures and related topics","author":"L.J. Hubert","year":"1997","unstructured":"Hubert LJ, Arabie P, Meulman J (1997) Hierarchical clustering and the construction of (optimal) ultrametrics using L\n                        \n                  p\n                -norms. In: Dodge Y (ed) L\n                        1-statistical procedures and related topics. vol\u00a031 of Lecture Notes. Inst. Math. Statist., Berkley, U.S., pp 457\u2013472"},{"key":"145_CR12_145","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718553","volume-title":"Combinatorial data analysis: Optimization by dynamic programming","author":"L.J. Hubert","year":"2001","unstructured":"Hubert LJ, Arabie P, Meulman J (2001) Combinatorial data analysis: Optimization by dynamic programming. SIAM, Philadelphia"},{"key":"145_CR13_145","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02294091","volume":"43","author":"L.J. Hubert","year":"1978","unstructured":"Hubert LJ, Baker FB (1978) Applications of combinatorial programming to data analysis: The traveling salesman and related problems. Psychometrika 43:81\u201391","journal-title":"Psychometrika"},{"key":"145_CR14_145","first-page":"1034","volume":"7","author":"R.E. Jensen","year":"1969","unstructured":"Jensen RE (1969) A\u00a0dynamic programming algorithm for cluster analysis. J\u00a0Oper Res Soc Amer 7:1034\u20131057","journal-title":"J. Oper. Res. Soc. Amer."},{"key":"145_CR15_145","doi-asserted-by":"publisher","first-page":"293","DOI":"10.2307\/276978","volume":"16","author":"W.S. Robinson","year":"1951","unstructured":"Robinson WS (1951) A\u00a0method for chronologically ordering archaeological deposits. Amer Antiq 16:293\u2013301","journal-title":"Amer. Antiq."},{"key":"145_CR16_145","volume-title":"Cluster analysis algorithms","author":"H. Sp\u00e4th","year":"1980","unstructured":"Sp\u00e4th H (1980) Cluster analysis algorithms. Horwood, Westergate"}],"container-title":["Encyclopedia of Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-74759-0_145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:12:58Z","timestamp":1720696378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-74759-0_145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387747583","9780387747590"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-74759-0_145","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}