{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:27:46Z","timestamp":1759847266969,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100009002","name":"Ministry of Education and Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100009002","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3590650","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"371-374","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["On-line Quick Hypervolume Algorithm"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8337-888X","authenticated-orcid":false,"given":"Andrzej","family":"Jaszkiewicz","sequence":"first","affiliation":[{"name":"Faculty of Computing and Telecommunications, Poznan University of Technology, Poznan, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6996-3671","authenticated-orcid":false,"given":"Piotr","family":"Zielniewicz","sequence":"additional","affiliation":[{"name":"Faculty of Computing and Telecommunications, Poznan University of Technology, Poznan, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-05805-1"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-018-3631-x"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754777"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5220\/0006577903730384"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2729550"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3453474"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00104-7"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.09.016"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449639.3459394"},{"volume-title":"Parallel Problem Solving from Nature - PPSN XVII, G\u00fcnter Rudolph, Anna V","author":"Jaszkiewicz Andrzej","key":"e_1_3_2_2_10_1","unstructured":"Andrzej Jaszkiewicz and Piotr Zielniewicz . 2022. Greedy Decremental Quick Hypervolume Subset Selection Algorithms . In Parallel Problem Solving from Nature - PPSN XVII, G\u00fcnter Rudolph, Anna V . Kononova, Hern\u00e1n Aguirre, Pascal Kerschke, Gabriela Ochoa, and Tea Tu\u0161ar (Eds.). Springer International Publishing , Cham , 164--178. Andrzej Jaszkiewicz and Piotr Zielniewicz. 2022. Greedy Decremental Quick Hypervolume Subset Selection Algorithms. In Parallel Problem Solving from Nature - PPSN XVII, G\u00fcnter Rudolph, Anna V. Kononova, Hern\u00e1n Aguirre, Pascal Kerschke, Gabriela Ochoa, and Tea Tu\u0161ar (Eds.). Springer International Publishing, Cham, 164--178."},{"key":"e_1_3_2_2_11_1","volume-title":"The 2003 Congress on Evolutionary Computation, 2003. CEC '03.","volume":"4","author":"Knowles J. D.","unstructured":"J. D. Knowles , D. W. Corne , and M. Fleischer . 2003. Bounded archiving using the lebesgue measure . In The 2003 Congress on Evolutionary Computation, 2003. CEC '03. , Vol. 4 . 2490--2497 Vol.4. J. D. Knowles, D. W. Corne, and M. Fleischer. 2003. Bounded archiving using the lebesgue measure. In The 2003 Congress on Evolutionary Computation, 2003. CEC '03., Vol. 4. 2490--2497 Vol.4."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.06.021"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"crossref","unstructured":"B. Li J. Li K. Tang and X. Yao. 2015. Many-Objective Evolutionary Algorithms: A Survey. ACM Computing Surveys 48 1 (2015).  B. Li J. Li K. Tang and X. Yao. 2015. Many-Objective Evolutionary Algorithms: A Survey. ACM Computing Surveys 48 1 (2015).","DOI":"10.1145\/2792984"},{"key":"e_1_3_2_2_14_1","volume-title":"Multiobjective Optimisation: A Survey. Comput. Surveys 52, 2, Article 26","author":"Li M.","year":"2019","unstructured":"M. Li and X. Yao . 2019 . Quality Evaluation of Solution Sets in Multiobjective Optimisation: A Survey. Comput. Surveys 52, 2, Article 26 (2019). M. Li and X. Yao. 2019. Quality Evaluation of Solution Sets in Multiobjective Optimisation: A Survey. Comput. Surveys 52, 2, Article 26 (2019)."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205455.3205466"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3013290"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2013.05.004"},{"volume-title":"Parallel Problem Solving from Nature - PPSN X, G\u00fcnter Rudolph","author":"Trautmann Heike","key":"e_1_3_2_2_18_1","unstructured":"Heike Trautmann , Uwe Ligges , J\u00f6rn Mehnen , and Mike Preuss . 2008. A Convergence Criterion for Multiobjective Evolutionary Algorithms Based on Systematic Statistical Testing . In Parallel Problem Solving from Nature - PPSN X, G\u00fcnter Rudolph , Thomas Jansen, Nicola Beume, Simon Lucas, and Carlo Poloni (Eds.). Springer Berlin Heidelberg, Berlin , Heidelberg , 825--836. Heike Trautmann, Uwe Ligges, J\u00f6rn Mehnen, and Mike Preuss. 2008. A Convergence Criterion for Multiobjective Evolutionary Algorithms Based on Systematic Statistical Testing. In Parallel Problem Solving from Nature - PPSN X, G\u00fcnter Rudolph, Thomas Jansen, Nicola Beume, Simon Lucas, and Carlo Poloni (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 825--836."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586474"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19893-9_2"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2077298"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"}],"event":{"name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Lisbon Portugal","acronym":"GECCO '23 Companion"},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3590650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:45Z","timestamp":1750178265000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":23,"alternative-id":["10.1145\/3583133.3590650","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3590650","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}