{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:39:29Z","timestamp":1742963969230,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030218027"},{"type":"electronic","value":"9783030218034"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_79","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"790-799","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["K-Medoids Clustering Is Solvable in Polynomial Time for a 2d Pareto Front"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Dupin","sequence":"first","affiliation":[]},{"given":"Frank","family":"Nielsen","sequence":"additional","affiliation":[]},{"given":"El-Ghazali","family":"Talbi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"79_CR1","unstructured":"Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245\u2013248 (2009)"},{"key":"79_CR2","doi-asserted-by":"crossref","unstructured":"Auger, A., Bader, J., Brockhoff, D., Zitzler, E.: Investigating and exploiting the bias of the weighted hypervolume to articulate user preferences. In: Proceedings of GECCO 2009, pp. 563\u2013570. ACM (2009)","DOI":"10.1145\/1569901.1569980"},{"key":"79_CR3","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Friedrich, T., Klitzke, P.: Two-dimensional subset selection for hypervolume and epsilon-indicator. In: Annual Conference on Genetic and Evolutionary Computation, pp. 589\u2013596. ACM (2014)","DOI":"10.1145\/2576768.2598276"},{"key":"79_CR4","unstructured":"Dupin, N.: Mod\u00e9lisation et r\u00e9solution de grands probl\u00e8mes stochastiques combinatoires: application \u00e0 la gestion de production d\u2019\u00e9lectricit\u00e9. Ph.D. thesis, University Lille 1 (2015)"},{"key":"79_CR5","unstructured":"Dupin, N., Nielsen, F., Talbi, E.: Clustering in a 2d pareto front: p-median and p-center are solvable in polynomial time, pp. 1\u201324 (2018). \n                    arXiv:1806.02098"},{"key":"79_CR6","unstructured":"Dupin, N., Nielsen, F., Talbi, E.: Dynamic programming heuristic for k-means clustering among a 2-dimensional pareto frontier. In: 7th International Conference on Metaheuristics and Nature Inspired Computing, pp. 1\u20138 (2018)"},{"key":"79_CR7","doi-asserted-by":"crossref","unstructured":"Ehrgott, M., Gandibleux, X.: Multiobjective combinatorial optimization-theory, methodology, and applications. In: Multiple Criteria Optimization: State of the Art Annotated Bibliographic Surveys, pp. 369\u2013444. Springer (2003)","DOI":"10.1007\/0-306-48107-3_8"},{"key":"79_CR8","unstructured":"Gr\u00f8nlund, A., Larsen, K.G., Mathiasen, A., Nielsen, J.S., Schneider, S., Song, M.: Fast exact k-means, k-medians and bregman divergence clustering in 1d (2017). arXiv preprint \n                    arXiv:1701.07204"},{"issue":"3","key":"79_CR9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"W Hsu","year":"1979","unstructured":"Hsu, W., Nemhauser, G.: Easy and hard bottleneck location problems. Discret. Appl. Math. 1(3), 209\u2013215 (1979)","journal-title":"Discret. Appl. Math."},{"issue":"8","key":"79_CR10","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1016\/j.patrec.2009.09.011","volume":"31","author":"A Jain","year":"2010","unstructured":"Jain, A.: Data clustering: 50 years beyond k-means. Pattern Recognit. Lett. 31(8), 651\u2013666 (2010)","journal-title":"Pattern Recognit. Lett."},{"key":"79_CR11","unstructured":"Kaufman, L., Rousseeuw, P.: Clustering by Means of Medoids (1987)"},{"issue":"3","key":"79_CR12","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1162\/EVCO_a_00157","volume":"24","author":"T Kuhn","year":"2016","unstructured":"Kuhn, T., Fonseca, C.M., Paquete, L., Ruzika, S., Duarte, M.M., Figueira, J.R.: Hypervolume subset selection in two dimensions: formulations and algorithms. Evol. Comput. 24(3), 411\u2013425 (2016)","journal-title":"Evol. Comput."},{"issue":"2","key":"79_CR13","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"79_CR14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(96)00116-0","volume":"59","author":"F Nielsen","year":"1996","unstructured":"Nielsen, F.: Output-sensitive peeling of convex and maximal layers. Inf. Process. Lett. 59(5), 255\u2013259 (1996)","journal-title":"Inf. Process. Lett."},{"key":"79_CR15","doi-asserted-by":"crossref","unstructured":"Nielsen, F.: Introduction to HPC with MPI for Data Science. Springer (2016)","DOI":"10.1007\/978-3-319-21903-5"},{"key":"79_CR16","doi-asserted-by":"crossref","unstructured":"Peugeot, T., Dupin, N., Sembely, M.J., Dubecq, C.: MBSE, PLM, MIP and robust optimization for system of systems management, application to SCCOA French air defense program. In: Complex Systems Design & Management, pp. 29\u201340. Springer (2017)","DOI":"10.1007\/978-3-319-49103-5_3"},{"key":"79_CR17","doi-asserted-by":"crossref","unstructured":"Rasson, J.P., Kubushishi, T.: The gap test: an optimal method for determining the number of natural classes in cluster analysis. In: New Approaches in Classification and Data Analysis, pp. 186\u2013193. Springer (1994)","DOI":"10.1007\/978-3-642-51175-2_21"},{"issue":"10","key":"79_CR18","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1016\/j.jpdc.2012.05.013","volume":"72","author":"E Saule","year":"2012","unstructured":"Saule, E., Ba\u015f, E., \u00c7ataly\u00fcrek, \u00dc.: Load-balancing spatially located computations using rectangular partitions. J. Parallel Distrib. Comput. 72(10), 1201\u20131214 (2012)","journal-title":"J. Parallel Distrib. Comput."},{"key":"79_CR19","unstructured":"Schubert, E., Rousseeuw, P.: Faster k-Medoids clustering: improving the PAM, CLARA, and CLARANS algorithms (2018). arXiv preprint \n                    arXiv:1810.05691"},{"issue":"6","key":"79_CR20","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10732-006-7284-z","volume":"12","author":"W Sheng","year":"2006","unstructured":"Sheng, W., Liu, X.: A genetic k-medoids clustering algorithm. J. Heuristics 12(6), 447\u2013466 (2006)","journal-title":"J. Heuristics"},{"key":"79_CR21","doi-asserted-by":"crossref","unstructured":"Talbi, E.: Metaheuristics: From Design to Implementation. Wiley (2009)","DOI":"10.1002\/9780470496916"},{"key":"79_CR22","doi-asserted-by":"crossref","unstructured":"Wang, H., Song, M.: Ckmeans. 1d. dp: optimal k-means clustering in one dimension by dynamic programming. The R J. 3(2), 29 (2011)","DOI":"10.32614\/RJ-2011-015"},{"issue":"3","key":"79_CR23","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/j.ejor.2010.10.021","volume":"210","author":"E Zio","year":"2011","unstructured":"Zio, E., Bazzo, R.: A clustering procedure for reducing the number of representative solutions in the Pareto Front of multiobjective optimization problems. Eur. J. Oper. Res. 210(3), 624\u2013634 (2011)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:56:43Z","timestamp":1572587803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_79","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}