{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:25:48Z","timestamp":1775143548473,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031147203","type":"print"},{"value":"9783031147210","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-14721-0_12","type":"book-chapter","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T00:02:52Z","timestamp":1660521772000},"page":"164-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Greedy Decremental Quick Hypervolume Subset Selection Algorithms"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8337-888X","authenticated-orcid":false,"given":"Andrzej","family":"Jaszkiewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6996-3671","authenticated-orcid":false,"given":"Piotr","family":"Zielniewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,15]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Bader, J., Deb, K., Zitzler, E.: Faster hypervolume-based search using monte carlo sampling. In: Ehrgott, M., Naujoks, B., Stewart, T.J., Wallenius, J. (eds.) Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, pp. 313\u2013326. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-642-04045-0_27","DOI":"10.1007\/978-3-642-04045-0_27"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Bader, J., Zitzler, E.: HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol. Comput. 19(1), 45\u201376 (2011)","DOI":"10.1162\/EVCO_a_00009"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Basseur, M., Derbel, B., Go\u00ebffon, A., Liefooghe, A.: Experiments on greedy and local search heuristics for dimensional hypervolume subset selection. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2016, pp. 541\u2013548. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2908812.2908949","DOI":"10.1145\/2908812.2908949"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Beume, N., Fonseca, C.M., Lopez-Ibanez, M., Paquete, L., Vahrenhold, J.: On the complexity of computing the hypervolume indicator. IEEE Trans. Evol. Comput. 13(5), 1075\u20131082 (2009)","DOI":"10.1109\/TEVC.2009.2015575"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Beume, N., Naujoks, B., Emmerich, M.: Sms-emoa: multiobjective selection based on dominated hypervolume. Euro. J. Operat. Res. 181, 1653\u20131669 (2007). https:\/\/doi.org\/10.1016\/j.ejor.2006.08.008","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Bradstreet, L., While, L., Barone, L.: Incrementally maximising hypervolume for selection in multi-objective evolutionary algorithms. In: 2007 IEEE Congress on Evolutionary Computation, pp. 3203\u20133210. IEEE (2007)","DOI":"10.1109\/CEC.2007.4424881"},{"key":"12_CR7","unstructured":"Bringmann, K., Cabello, S., Emmerich, M.T.M.: Maximum Volume Subset Selection for Anchored Boxes. In: Aronov, B., Katz, M.J. (eds.) 33rd International Symposium on Computational Geometry (SoCG 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 77, pp. 22:1\u201322:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl (2017)"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Bringmann, K., Friedrich, T., Klitzke, P.: Generic postprocessing via subset selection for hypervolume and epsilon-indicator. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 518\u2013527. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_51","DOI":"10.1007\/978-3-319-10762-2_51"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Brockhoff, D., Tran, T., Hansen, N.: Benchmarking numerical multiobjective optimizers revisited. In: Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 639\u2013646. GECCO 2015. Association for Computing Machinery, New York (2015)","DOI":"10.1145\/2739480.2754777"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Chan, T.M.: Klee\u2019s measure problem made easy. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 410\u2013419 (2013)","DOI":"10.1109\/FOCS.2013.51"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Chen, W., Ishibuchi, H., Shang, K.: Lazy greedy hypervolume subset selection from large candidate solution sets. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1\u20138 (2020)","DOI":"10.1109\/CEC48606.2020.9185878"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Cox, W., While, L.: Improving the iwfg algorithm for calculating incremental hypervolume. In: 2016 IEEE Congress on Evolutionary Computation (CEC), pp. 3969\u20133976 (2016)","DOI":"10.1109\/CEC.2016.7744293"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Friedrich, T., Neumann, F.: Maximizing submodular functions under matroid constraints by multi-objective evolutionary algorithms. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 922\u2013931. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_91","DOI":"10.1007\/978-3-319-10762-2_91"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Guerreiro, A.P., Fonseca, C.M.: Computing and updating hypervolume contributions in up to four dimensions. IEEE Trans. Evol. Comput. 22(3), 449\u2013463 (2018)","DOI":"10.1109\/TEVC.2017.2729550"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Guerreiro, A.P., Fonseca, C.M., Paquete, L.: Greedy hypervolume subset selection in low dimensions. Evol. Comput. 24(3), 521\u2013544 (2016)","DOI":"10.1162\/EVCO_a_00188"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Guerreiro, A.P., Fonseca, C.M., Paquete, L.: The hypervolume indicator: Problems and algorithms (2020)","DOI":"10.1145\/3453474"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Jaszkiewicz, A.: Improved quick hypervolume algorithm. Comput. Oper. Res. 90, 72\u201383 (2018)","DOI":"10.1016\/j.cor.2017.09.016"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Jaszkiewicz, A., Zielniewicz, P.: Quick Extreme Hypervolume Contribution Algorithm, pp. 412\u2013420. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3449639.3459394","DOI":"10.1145\/3449639.3459394"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Jiang, S., Zhang, J., Ong, Y., Zhang, A.N., Tan, P.S.: A simple and fast hypervolume indicator-based multiobjective evolutionary algorithm. IEEE Trans. Cybern. 45(10), 2202\u20132213 (2015). https:\/\/doi.org\/10.1109\/TCYB.2014.2367526","DOI":"10.1109\/TCYB.2014.2367526"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Knowles, J.D., Corne, D.W., Fleischer, M.: Bounded archiving using the lebesgue measure. In: The 2003 Congress on Evolutionary Computation, CEC 2003, vol. 4, pp. 2490\u20132497 (2003)","DOI":"10.1109\/CEC.2003.1299401"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Lacour, R., Klamroth, K., Fonseca, C.M.: A box decomposition algorithm to compute the hypervolume indicator. Comput. Oper. Res. 79, 347\u2013360 (2017)","DOI":"10.1016\/j.cor.2016.06.021"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Laitila, J., Moilanen, A.: New performance guarantees for the greedy maximization of submodular set functions. Optimization Letters 11(4), 655\u2013665 (2016). https:\/\/doi.org\/10.1007\/s11590-016-1039-z","DOI":"10.1007\/s11590-016-1039-z"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Li, B., Li, J., Tang, K., Yao, X.: Many-objective evolutionary algorithms: a survey. ACM Comput. Surv. 48(1), 1\u201335 (2015)","DOI":"10.1145\/2792984"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Li, M., Yao, X.: Quality evaluation of solution sets in multiobjective optimisation: a survey. ACM Comput. Surv. 52(2), 1\u201338 (2019)","DOI":"10.1145\/3300148"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Minoux, M.: Accelerated greedy algorithms for maximizing submodular set functions. In: Stoer, J. (ed.) Optimization Techniques, pp. 234\u2013243. Springer, Berlin (1978). https:\/\/doi.org\/10.1007\/BFb0006528","DOI":"10.1007\/BFb0006528"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions-i. Math. Program. 14(1), 265\u2013294 (1978)","DOI":"10.1007\/BF01588971"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Russo, L.M.S., Francisco, A.P.: Quick Hypervolume. IEEE Trans. Evol. Comput. 18(4), 481\u2013502 (2014)","DOI":"10.1109\/TEVC.2013.2281525"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Russo, L.M.S., Francisco, A.P.: Extending quick hypervolume. J. Heuristics 22(3), 245\u2013271 (2016). https:\/\/doi.org\/10.1007\/s10732-016-9309-6","DOI":"10.1007\/s10732-016-9309-6"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Seo, M.G., Shin, H.S.: Greedily excluding algorithm for submodular maximization. In: 2018 IEEE Conference on Control Technology and Applications (CCTA), pp. 1680\u20131685 (2018). https:\/\/doi.org\/10.1109\/CCTA.2018.8511628","DOI":"10.1109\/CCTA.2018.8511628"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Shang, K., Ishibuchi, H., He, L., Pang, L.M.: A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Trans. Evol. Comput. 25(1), 1\u201320 (2021)","DOI":"10.1109\/TEVC.2020.3013290"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Shang, K., Ishibuchi, H., Ni, X.: R2-based hypervolume contribution approximation. IEEE Trans. Evol. Comput. 24(1), 185\u2013192 (2020)","DOI":"10.1109\/TEVC.2019.2909271"},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Ulrich, T., Thiele, L.: Bounding the effectiveness of hypervolume-based ($$\\upmu +\\uplambda $$)-archiving algorithms. In: Proceedings of the 6th International Conference on Learning and Intelligent Optimization, LION 2012, pp. 235\u2013249. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-34413-8_17"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"While, L., Bradstreet, L.: Applying the wfg algorithm to calculate incremental hypervolumes. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1\u20138 (2012)","DOI":"10.1109\/CEC.2012.6256171"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"While, L., Bradstreet, L., Barone, L.: A fast way of calculating exact hypervolumes. IEEE Trans. Evol. Comput. 16(1), 86\u201395 (2012)","DOI":"10.1109\/TEVC.2010.2077298"},{"key":"12_CR35","doi-asserted-by":"publisher","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., et al. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832\u2013842. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30217-9_84","DOI":"10.1007\/978-3-540-30217-9_84"},{"key":"12_CR36","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3(4), 257\u2013271 (1999)","DOI":"10.1109\/4235.797969"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L., Bader, J.: On set-based multiobjective optimization. IEEE Trans. Evol. Comput. 14(1), 58\u201379 (2010)","DOI":"10.1109\/TEVC.2009.2016569"},{"key":"12_CR38","doi-asserted-by":"crossref","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","DOI":"10.1109\/TEVC.2003.810758"}],"container-title":["Lecture Notes in Computer Science","Parallel Problem Solving from Nature \u2013 PPSN XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-14721-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,1]],"date-time":"2024-10-01T18:24:20Z","timestamp":1727807060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-14721-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031147203","9783031147210"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-14721-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPSN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Problem Solving from Nature","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dortmund","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppsn2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ppsn2022.cs.tu-dortmund.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"185","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.75","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}