{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T15:52:00Z","timestamp":1778601120116,"version":"3.51.4"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Evol. Computat."],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/tevc.2017.2729550","type":"journal-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T18:13:14Z","timestamp":1500574394000},"page":"449-463","source":"Crossref","is-referenced-by-count":42,"title":["Computing and Updating Hypervolume Contributions in Up to Four Dimensions"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0757-2709","authenticated-orcid":false,"given":"Andreia P.","family":"Guerreiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5162-2457","authenticated-orcid":false,"given":"Carlos M.","family":"Fonseca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54157-0_46"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688518"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2016.06.021"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2010.5586344"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.919001"},{"key":"ref30","first-page":"243","author":"cox","year":"2016","journal-title":"Improving and Extending the HV4D Algorithm for Calculating Hypervolume Exactly"},{"key":"ref37","first-page":"58","article-title":"Selecting K points that maximize the convex hull volume","author":"rote","year":"2016","journal-title":"Proc 19th Japan Conf Discr Comput Geometry Graphs Games"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1007\/978-3-319-10762-2_65","article-title":"Empirical performance of the approximation of the least hypervolume contributor","author":"nowak","year":"2014","journal-title":"Parallel Problem Solving from Nature - PPSN XII"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/978-3-642-01020-0_6","article-title":"Approximating the least hypervolume contributor: NP-hard in general, but fast in practice","author":"bringmann","year":"2009","journal-title":"Evolutionary Multi-Criterion Optimization (LNCS 5467)"},{"key":"ref34","first-page":"3969","article-title":"Improving the IWFG algorithm for calculating incremental hypervolume","author":"cox","year":"2016","journal-title":"Proc IEEE CEC"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00157"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00012"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2007.4424881"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1007\/978-3-319-10762-2_91","article-title":"Maximizing submodular functions under matroid constraints by multi-objective evolutionary algorithms","author":"friedrich","year":"2014","journal-title":"Parallel Problem Solving From Nature—PPSN XIII (LNCS 8672)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00188"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.08.008"},{"key":"ref16","first-page":"410","article-title":"Klee’s measure problem made easy","author":"chan","year":"2013","journal-title":"Proc IEEE Symp Found Comput Sci (FOCS)"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-3-642-19893-9_9","article-title":"Computing hypervolume contributions in low dimensions: Asymptotically optimal algorithm and complexity results","author":"emmerich","year":"2011","journal-title":"Evolutionary Multi-Criterion Optimization (LNCS 6576)"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1162\/evco.2007.15.1.1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-01128-8_11"},{"key":"ref28","first-page":"111","article-title":"On Klee’s measure problem for grounded boxes","author":"y?ld?z","year":"2012","journal-title":"Proc Ann Symp Computational Geometry (SoCG)"},{"key":"ref4","first-page":"292","article-title":"Multiobjective optimization using evolutionary algorithms—A comparative case study","author":"zitzler","year":"1998","journal-title":"Parallel Problem Solving From Nature (LNCS 6238)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688440"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299401"},{"key":"ref6","first-page":"832","article-title":"Indicator-based selection in multiobjective search","author":"zitzler","year":"2004","journal-title":"Parallel Problem Solving from Nature—PPSN VIII (LNCS 3242)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2005.851275"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299373"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00009"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-540-31880-4_5","article-title":"An EMO algorithm using the hypervolume measure as selection criterion","author":"emmerich","year":"2005","journal-title":"Evolutionary Multi-Criterion Optimization (LNCS)"},{"key":"ref2","author":"deb","year":"2001","journal-title":"Multi-Objective Optimization Using Evolutionary Algorithms"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2576768.2598276"},{"key":"ref1","author":"ehrgott","year":"2005","journal-title":"Multicriteria Optimization"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2009.4982992"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2014.2341711"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2014.2367526"},{"key":"ref24","first-page":"77","article-title":"A fast dimension-sweep algorithm for the hypervolume indicator in four dimensions","author":"guerreiro","year":"2012","journal-title":"Proc CCCG"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2015575"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281525"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2010.2077298"}],"container-title":["IEEE Transactions on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4235\/8367832\/07987007.pdf?arnumber=7987007","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T04:57:34Z","timestamp":1643173054000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7987007\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":39,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tevc.2017.2729550","relation":{},"ISSN":["1089-778X","1089-778X","1941-0026"],"issn-type":[{"value":"1089-778X","type":"print"},{"value":"1089-778X","type":"print"},{"value":"1941-0026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}