{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T07:30:15Z","timestamp":1776065415296,"version":"3.50.1"},"reference-count":91,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T00:00:00Z","timestamp":1627344000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/CEC\/00326\/2020, P2020 SAICTPAC\/0011\/2015, SFRH\/BD\/77725\/2011, PTDC\/CCI-COM\/31198\/2017, UIDB\/50021\/2020"],"award-info":[{"award-number":["UID\/CEC\/00326\/2020, P2020 SAICTPAC\/0011\/2015, SFRH\/BD\/77725\/2011, PTDC\/CCI-COM\/31198\/2017, UIDB\/50021\/2020"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["P2020 SAICTPAC\/0011\/2015"],"award-info":[{"award-number":["P2020 SAICTPAC\/0011\/2015"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["SFRH\/BD\/77725\/2011"],"award-info":[{"award-number":["SFRH\/BD\/77725\/2011"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2022,7,31]]},"abstract":"<jats:p>The hypervolume indicator is one of the most used set-quality indicators for the assessment of stochastic multiobjective optimizers, as well as for selection in evolutionary multiobjective optimization algorithms. Its theoretical properties justify its wide acceptance, particularly the strict monotonicity with respect to set dominance, which is still unique of hypervolume-based indicators. This article discusses the computation of hypervolume-related problems, highlighting the relations between them, providing an overview of the paradigms and techniques used, a description of the main algorithms for each problem, and a rundown of the fastest algorithms regarding asymptotic complexity and runtime. By providing a complete overview of the computational problems associated to the hypervolume indicator, this article serves as the starting point for the development of new algorithms and supports users in the identification of the most appropriate implementations available for each problem.<\/jats:p>","DOI":"10.1145\/3453474","type":"journal-article","created":{"date-parts":[[2021,7,27]],"date-time":"2021-07-27T12:32:27Z","timestamp":1627389147000},"page":"1-42","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":226,"title":["The Hypervolume Indicator"],"prefix":"10.1145","volume":"54","author":[{"given":"Andreia P.","family":"Guerreiro","sequence":"first","affiliation":[{"name":"University of Coimbra, Portugal and INESC-ID, Portugal"}]},{"given":"Carlos M.","family":"Fonseca","sequence":"additional","affiliation":[{"name":"University of Coimbra, Portugal"}]},{"given":"Lu\u00eds","family":"Paquete","sequence":"additional","affiliation":[{"name":"University of Coimbra, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2021,7,27]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885031.1885095"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569980"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527138"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1115\/1.1329875"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908812.2908949"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/358841.358850"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2009.17.4.17402"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2015575"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings 2nd IASTED Conference on Computational Intelligence","author":"Beume Nicola","year":"2006","unstructured":"Nicola Beume and G\u00fcnter Rudolph . 2006 . Faster S-metric calculation by considering dominated hypervolume as Klee\u2019s measure problem . In Proceedings 2nd IASTED Conference on Computational Intelligence (2006), 231\u2013236. Nicola Beume and G\u00fcnter Rudolph. 2006. Faster S-metric calculation by considering dominated hypervolume as Klee\u2019s measure problem. In Proceedings 2nd IASTED Conference on Computational Intelligence (2006), 231\u2013236."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688518"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1689599.1689669"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424881"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.919001"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2031028"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586344"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810959.1810999"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40313-2_20"},{"key":"e_1_2_1_20_1","first-page":"1","article-title":"Maximum volume subset selection for anchored boxes. In Proceedings of the 33rd International Symposium on Computational Geometry (SoCG\u201917). Dagstuhl Publishing, Schloss Dagstuhl Leibniz-Zentrum f\u00fcr Informatik","volume":"22","author":"Bringmann Karl","year":"2017","unstructured":"Karl Bringmann , Sergio Cabello , and Michael T. M. Emmerich . 2017 . Maximum volume subset selection for anchored boxes. In Proceedings of the 33rd International Symposium on Computational Geometry (SoCG\u201917). Dagstuhl Publishing, Schloss Dagstuhl Leibniz-Zentrum f\u00fcr Informatik , Germany , 22 : 1 \u2013 22 :15. Karl Bringmann, Sergio Cabello, and Michael T. M. Emmerich. 2017. Maximum volume subset selection for anchored boxes. In Proceedings of the 33rd International Symposium on Computational Geometry (SoCG\u201917). Dagstuhl Publishing, Schloss Dagstuhl Leibniz-Zentrum f\u00fcr Informatik, Germany, 22:1\u201322:15.","journal-title":"Germany"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92182-0_40"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01020-0_6"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1527125.1527139"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1943267.1943271"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2341711"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598276"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1947457.1947461"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/mcda.1502"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2739480.2754777"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424730"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1377676.1377693"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.51"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 2020 IEEE Congress on Evolutionary Computation (CEC\u201920)","author":"Chen W.","unstructured":"W. Chen , H. Ishibuchi , and K. Shang . 2020. Lazy greedy hypervolume subset selection from large candidate solution sets . In Proceedings of the 2020 IEEE Congress on Evolutionary Computation (CEC\u201920) . 1\u20138. W. Chen, H. Ishibuchi, and K. Shang. 2020. Lazy greedy hypervolume subset selection from large candidate solution sets. In Proceedings of the 2020 IEEE Congress on Evolutionary Computation (CEC\u201920). 1\u20138."},{"key":"e_1_2_1_35_1","volume-title":"IEEE Congress on Evolutionary Computation (CEC\u201916)","author":"Cox W.","unstructured":"W. Cox and L. While . 2016. Improving the IWFG algorithm for calculating incremental hypervolume . In IEEE Congress on Evolutionary Computation (CEC\u201916) . 3969\u20133976. W. Cox and L. While. 2016. Improving the IWFG algorithm for calculating incremental hypervolume. In IEEE Congress on Evolutionary Computation (CEC\u201916). 3969\u20133976."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0205-z"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 2002 Congress on Evolutionary Computation (CEC\u201902)","volume":"1","author":"Deb K.","unstructured":"K. Deb , L. Thiele , M. Laumanns , and E. Zitzler . 2002. Scalable multi-objective optimization test problems . In Proceedings of the 2002 Congress on Evolutionary Computation (CEC\u201902) , Vol. 1 . 825\u2013830. K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. 2002. Scalable multi-objective optimization test problems. In Proceedings of the 2002 Congress on Evolutionary Computation (CEC\u201902), Vol. 1. 825\u2013830."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_5"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987637.1987647"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2011.5949880"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321730"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/1760102.1760146"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688440"},{"key":"e_1_2_1_44_1","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Problem Solving from Nature\u2014PPSN XIII, Thomas Bartz-Beielstein et\u00a0al. (Eds.)","author":"Friedrich Tobias","unstructured":"Tobias Friedrich and Frank Neumann . 2014. Maximizing submodular functions under matroid constraints by multi-objective evolutionary algorithms . In Parallel Problem Solving from Nature\u2014PPSN XIII, Thomas Bartz-Beielstein et\u00a0al. (Eds.) . Lecture Notes in Computer Science , Vol. 8672 . Springer International Publishing , 922\u2013931. Tobias Friedrich and Frank Neumann. 2014. Maximizing submodular functions under matroid constraints by multi-objective evolutionary algorithms. In Parallel Problem Solving from Nature\u2014PPSN XIII, Thomas Bartz-Beielstein et\u00a0al. (Eds.). Lecture Notes in Computer Science, Vol. 8672. Springer International Publishing, 922\u2013931."},{"key":"e_1_2_1_45_1","volume-title":"Implicit enumeration strategies for the hypervolume subset selection problem. Comput. Operat. Res. 100 (Dec","author":"Gomes Ricardo J.","year":"2018","unstructured":"Ricardo J. Gomes , Andreia P. Guerreiro , Tobias Kuhn , and Lu\u00eds Paquete . 2018. Implicit enumeration strategies for the hypervolume subset selection problem. Comput. Operat. Res. 100 (Dec . 2018 ), 244\u2013253. Ricardo J. Gomes, Andreia P. Guerreiro, Tobias Kuhn, and Lu\u00eds Paquete. 2018. Implicit enumeration strategies for the hypervolume subset selection problem. Comput. Operat. Res. 100 (Dec. 2018), 244\u2013253."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00235"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35533-2_3"},{"key":"e_1_2_1_48_1","volume-title":"Efficient Algorithms for the Assessment of Stochastic Multiobjective Optimizers. Master\u2019s thesis. IST","author":"Guerreiro Andreia P.","unstructured":"Andreia P. Guerreiro . 2011. Efficient Algorithms for the Assessment of Stochastic Multiobjective Optimizers. Master\u2019s thesis. IST , Technical University of Lisbon , Portugal . Andreia P. Guerreiro. 2011. Efficient Algorithms for the Assessment of Stochastic Multiobjective Optimizers. Master\u2019s thesis. IST, Technical University of Lisbon, Portugal."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2017.2729550"},{"key":"e_1_2_1_51_1","volume-title":"Proceedings of the Canadian Conference on Computational Geometry (CCCG\u201912)","author":"Guerreiro Andreia P.","unstructured":"Andreia P. Guerreiro , Carlos M. Fonseca , and Michael T. M. Emmerich . 2012. A fast dimension-sweep algorithm for the hypervolume indicator in four dimensions . In Proceedings of the Canadian Conference on Computational Geometry (CCCG\u201912) . 77\u201382. Andreia P. Guerreiro, Carlos M. Fonseca, and Michael T. M. Emmerich. 2012. A fast dimension-sweep algorithm for the hypervolume indicator in four dimensions. In Proceedings of the Canadian Conference on Computational Geometry (CCCG\u201912). 77\u201382."},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00188"},{"key":"e_1_2_1_53_1","volume-title":"EVOLVE: A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV, Michael Emmerich et\u00a0al. (Eds.). Advances in Intelligent Systems and Computing","author":"Hupkens Iris","unstructured":"Iris Hupkens and Michael Emmerich . 2013. Logarithmic-time updates in SMS-EMOA and hypervolume-based archiving . In EVOLVE: A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV, Michael Emmerich et\u00a0al. (Eds.). Advances in Intelligent Systems and Computing , Vol. 227 . Springer , Heidelberg , 155\u2013169. Iris Hupkens and Michael Emmerich. 2013. Logarithmic-time updates in SMS-EMOA and hypervolume-based archiving. In EVOLVE: A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV, Michael Emmerich et\u00a0al. (Eds.). Advances in Intelligent Systems and Computing, Vol. 227. Springer, Heidelberg, 155\u2013169."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.1.1"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071264"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.09.016"},{"key":"e_1_2_1_57_1","doi-asserted-by":"crossref","unstructured":"A. Jaszkiewicz R. Susmaga and P. Zielniewicz. 2020. Approximate hypervolume calculation with guaranteed or confidence bounds. In Parallel Problem Solving from Nature\u2014PPSN XVI Thomas B\u00e4ck et\u00a0al. (Eds.). Springer International Publishing Cham 215\u2013228.  A. Jaszkiewicz R. Susmaga and P. Zielniewicz. 2020. Approximate hypervolume calculation with guaranteed or confidence bounds. In Parallel Problem Solving from Nature\u2014PPSN XVI Thomas B\u00e4ck et\u00a0al. (Eds.). Springer International Publishing Cham 215\u2013228.","DOI":"10.1007\/978-3-030-58112-1_15"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1137\/070684483"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.03.031"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299401"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00157"},{"key":"e_1_2_1_64_1","volume-title":"Fonseca","author":"Lacour Renaud","year":"2017","unstructured":"Renaud Lacour , Kathrin Klamroth , and Carlos M . Fonseca . 2017 . A box decomposition algorithm to compute the hypervolume indicator. Comput. Operat. Res . 79 (Mar. 2017), 347\u2013360. Renaud Lacour, Kathrin Klamroth, and Carlos M. Fonseca. 2017. A box decomposition algorithm to compute the hypervolume indicator. Comput. Operat. Res. 79 (Mar. 2017), 347\u2013360."},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-016-1039-z"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3300148"},{"key":"e_1_2_1_67_1","series-title":"Lecture Notes in Computer Science","volume-title":"Luis Miguel Antonio, and Carlos A. Coello Coello","author":"Lopez Edgar Manoatl","year":"2015","unstructured":"Edgar Manoatl Lopez , Luis Miguel Antonio, and Carlos A. Coello Coello . 2015 . A GPU-based algorithm for a faster hypervolume contribution computation. In Evolutionary Multi-Criterion Optimization, Ant\u00f3nio Gaspar-Cunha et\u00a0al. (Eds.), Lecture Notes in Computer Science ,Vol. 9019. Springer International Publishing , Cham, 80\u201394. Edgar Manoatl Lopez, Luis Miguel Antonio, and Carlos A. Coello Coello. 2015. A GPU-based algorithm for a faster hypervolume contribution computation. In Evolutionary Multi-Criterion Optimization, Ant\u00f3nio Gaspar-Cunha et\u00a0al. (Eds.), Lecture Notes in Computer Science,Vol. 9019. Springer International Publishing, Cham, 80\u201394."},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987637.1987642"},{"key":"e_1_2_1_69_1","volume-title":"Mathematical Programming: The State of the Art, Achim Bachem et\u00a0al. (Eds.)","author":"Lov\u00e1sz Laszlo","unstructured":"Laszlo Lov\u00e1sz . 1983. Submodular functions and convexity . In Mathematical Programming: The State of the Art, Achim Bachem et\u00a0al. (Eds.) . Springer , Berlin , 235\u2013257. Laszlo Lov\u00e1sz. 1983. Submodular functions and convexity. In Mathematical Programming: The State of the Art, Achim Bachem et\u00a0al. (Eds.). Springer, Berlin, 235\u2013257."},{"key":"e_1_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3434333"},{"key":"e_1_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281525"},{"key":"e_1_2_1_73_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-016-9309-6"},{"key":"e_1_2_1_74_1","doi-asserted-by":"crossref","unstructured":"Johanna Schultes Michael Stiglmayr Kathrin Klamroth and Camilla Hahn. 2021. Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components. Optim. Eng. (2021).  Johanna Schultes Michael Stiglmayr Kathrin Klamroth and Camilla Hahn. 2021. Hypervolume scalarization for shape optimization to improve reliability and cost of ceramic components. Optim. Eng. (2021).","DOI":"10.1007\/s11081-020-09586-9"},{"key":"e_1_2_1_75_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00186-020-00702-0"},{"key":"e_1_2_1_76_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCTA.2018.8511628"},{"key":"e_1_2_1_77_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.3013290"},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598348"},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2020.2966014"},{"key":"e_1_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/1830483.1830569"},{"key":"e_1_2_1_81_1","doi-asserted-by":"publisher","DOI":"10.5555\/2427396.2427414"},{"key":"e_1_2_1_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3067695.3084205"},{"key":"e_1_2_1_83_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31880-4_23"},{"key":"e_1_2_1_84_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6256171"},{"key":"e_1_2_1_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2077298"},{"key":"e_1_2_1_86_1","volume-title":"Proceedings of the IEEE Congress on Evolutionary Computation(CEC\u201905)","volume":"3","author":"While Lyndon","year":"2005","unstructured":"Lyndon While , Lucas Bradstreet , Luigi Barone , and Phil Hingston . 2005 . Heuristics for optimizing the calculation of hypervolume for multi-objective optimization problems . In Proceedings of the IEEE Congress on Evolutionary Computation(CEC\u201905) , Vol. 3 . IEEE, 2225\u20132232. Lyndon While, Lucas Bradstreet, Luigi Barone, and Phil Hingston. 2005. Heuristics for optimizing the calculation of hypervolume for multi-objective optimization problems. In Proceedings of the IEEE Congress on Evolutionary Computation(CEC\u201905), Vol. 3. IEEE, 2225\u20132232."},{"key":"e_1_2_1_87_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851275"},{"key":"e_1_2_1_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/2261250.2261267"},{"key":"e_1_2_1_89_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2007.20"},{"key":"e_1_2_1_91_1","doi-asserted-by":"publisher","DOI":"10.5555\/1762545.1762618"},{"key":"e_1_2_1_92_1","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568202"},{"key":"e_1_2_1_93_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88908-3_14"},{"key":"e_1_2_1_94_1","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Problem Solving from Nature\u2014PPSN VIII, Xin Yao et\u00a0al. (Eds.)","author":"Zitzler Eckart","unstructured":"Eckart Zitzler and Simon K\u00fcnzli . 2004. Indicator-based selection in multiobjective search . In Parallel Problem Solving from Nature\u2014PPSN VIII, Xin Yao et\u00a0al. (Eds.) , Lecture Notes in Computer Science , Vol. 3242 . Springer , Heidelberg , 832\u2013842. Eckart Zitzler and Simon K\u00fcnzli. 2004. Indicator-based selection in multiobjective search. In Parallel Problem Solving from Nature\u2014PPSN VIII, Xin Yao et\u00a0al. (Eds.), Lecture Notes in Computer Science, Vol. 3242. Springer, Heidelberg, 832\u2013842."},{"key":"e_1_2_1_95_1","doi-asserted-by":"publisher","DOI":"10.5555\/645824.668610"},{"key":"e_1_2_1_96_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.797969"},{"key":"e_1_2_1_97_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2016569"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453474","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3453474","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:07Z","timestamp":1750197787000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3453474"}},"subtitle":["Computational Problems and Algorithms"],"short-title":[],"issued":{"date-parts":[[2021,7,27]]},"references-count":91,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,7,31]]}},"alternative-id":["10.1145\/3453474"],"URL":"https:\/\/doi.org\/10.1145\/3453474","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,27]]},"assertion":[{"value":"2020-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}