{"id":"https://openalex.org/W2736457838","doi":"https://doi.org/10.1109/tevc.2017.2729550","title":"Computing and Updating Hypervolume Contributions in Up to Four Dimensions","display_name":"Computing and Updating Hypervolume Contributions in Up to Four Dimensions","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2736457838","doi":"https://doi.org/10.1109/tevc.2017.2729550","mag":"2736457838"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2017.2729550","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2017.2729550","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066470602","display_name":"Andreia P. Guerreiro","orcid":"https://orcid.org/0000-0003-0757-2709"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Andreia P. Guerreiro","raw_affiliation_strings":["Centre for Informatics and Systems, University of Coimbra, Coimbra, Portugal"],"raw_orcid":"https://orcid.org/0000-0003-0757-2709","affiliations":[{"raw_affiliation_string":"Centre for Informatics and Systems, University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038504776","display_name":"Carlos M. Fonseca","orcid":"https://orcid.org/0000-0001-5162-2457"},"institutions":[{"id":"https://openalex.org/I76903346","display_name":"University of Coimbra","ror":"https://ror.org/04z8k9a98","country_code":"PT","type":"education","lineage":["https://openalex.org/I76903346"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Carlos M. Fonseca","raw_affiliation_strings":["Centre for Informatics and Systems, University of Coimbra, Coimbra, Portugal"],"raw_orcid":"https://orcid.org/0000-0001-5162-2457","affiliations":[{"raw_affiliation_string":"Centre for Informatics and Systems, University of Coimbra, Coimbra, Portugal","institution_ids":["https://openalex.org/I76903346"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5066470602"],"corresponding_institution_ids":["https://openalex.org/I76903346"],"apc_list":null,"apc_paid":null,"fwci":5.451,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.96421743,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"22","issue":"3","first_page":"449","last_page":"463"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6679978370666504},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6079946160316467},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5798414349555969},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5540838241577148},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5323306322097778},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.530860960483551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5133063197135925},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5129889845848083},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43186238408088684},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3831004500389099},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.349467933177948},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3467225432395935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.325526624917984},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13465991616249084},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07498428225517273}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6679978370666504},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6079946160316467},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5798414349555969},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5540838241577148},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5323306322097778},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.530860960483551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5133063197135925},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5129889845848083},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43186238408088684},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3831004500389099},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.349467933177948},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3467225432395935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.325526624917984},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13465991616249084},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07498428225517273},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tevc.2017.2729550","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2017.2729550","pdf_url":null,"source":{"id":"https://openalex.org/S93787993","display_name":"IEEE Transactions on Evolutionary Computation","issn_l":"1089-778X","issn":["1089-778X","1941-0026"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Evolutionary Computation","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W82483302","https://openalex.org/W86912879","https://openalex.org/W118842119","https://openalex.org/W1491287429","https://openalex.org/W1525375343","https://openalex.org/W1558919105","https://openalex.org/W1588375755","https://openalex.org/W1595498733","https://openalex.org/W1613794742","https://openalex.org/W1990341344","https://openalex.org/W2003356218","https://openalex.org/W2008049315","https://openalex.org/W2038420231","https://openalex.org/W2050914643","https://openalex.org/W2052185348","https://openalex.org/W2062023467","https://openalex.org/W2090797242","https://openalex.org/W2100228661","https://openalex.org/W2100830227","https://openalex.org/W2108968575","https://openalex.org/W2116938494","https://openalex.org/W2117068724","https://openalex.org/W2117362819","https://openalex.org/W2127474646","https://openalex.org/W2129392074","https://openalex.org/W2132936405","https://openalex.org/W2152297393","https://openalex.org/W2153654820","https://openalex.org/W2154781286","https://openalex.org/W2160088187","https://openalex.org/W2187701960","https://openalex.org/W2260039808","https://openalex.org/W2434562129","https://openalex.org/W2558268710","https://openalex.org/W2558334374","https://openalex.org/W2589080402","https://openalex.org/W2962987192","https://openalex.org/W3037787799","https://openalex.org/W4302557773","https://openalex.org/W6635433731","https://openalex.org/W6687166884","https://openalex.org/W6730363891"],"related_works":["https://openalex.org/W3204684126","https://openalex.org/W3117290964","https://openalex.org/W1594413663","https://openalex.org/W2962917430","https://openalex.org/W2163115662","https://openalex.org/W2028468530","https://openalex.org/W189401716","https://openalex.org/W2898570308","https://openalex.org/W2019216770","https://openalex.org/W2574250816"],"abstract_inverted_index":{"Arising":[0],"in":[1,15,37,63,100,152,156,164,185],"connection":[2],"with":[3],"multiobjective":[4],"selection":[5,11],"and":[6,60,65,94,104,129,143,192,205],"archiving,":[7],"the":[8,42,50,112,115,127,140,157,174,179,214],"hypervolume":[9,43,108,132,142],"subset":[10,18],"problem":[12],"(HSSP)":[13],"consists":[14],"finding":[16],"a":[17,25,172],"of":[19,24,33,56,106,114,117,131],"size":[20],"k":[21],"\u2264":[22],"n":[23,34,64],"set":[26],"X":[27],"\u2282":[28],"\u211d":[29],"<sup":[30,166,194],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[31,167,195],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">d</sup>":[32],"nondominated":[35],"points":[36],"d-dimensional":[38],"space":[39],"that":[40,213],"maximizes":[41],"indicator.":[44],"The":[45,78,102],"incremental":[46],"greedy":[47,80,119,176],"approximation":[48,54,85,177],"to":[49,97,178],"HSSP":[51,180],"has":[52,82],"an":[53],"guarantee":[55],"1":[57],"-":[58,187,198],"1/e,":[59],"is":[61,88,150],"polynomial":[62,69],"k,":[66,93],"while":[67,155],"no":[68,83],"exact":[70],"algorithms":[71,125,216],"are":[72,110,134,162],"known":[73,84],"for":[74,91,126,201],"d":[75,202,206],"\u2265":[76],"3.":[77],"decremental":[79,175],"counterpart":[81],"guarantee,":[86],"but":[87],"potentially":[89],"faster":[90],"large":[92],"still":[95],"leads":[96],"good":[98],"approximations":[99],"practice.":[101],"computation":[103,128],"update":[105,130],"individual":[107,145],"contributions":[109,133,146,161],"at":[111],"core":[113],"implementation":[116],"this":[118,122],"strategy.":[120],"In":[121,136],"paper,":[123],"new":[124],"developed.":[135],"three":[137],"dimensions,":[138],"updating":[139],"total":[141],"all":[144,160],"under":[147],"single-point":[148],"changes":[149],"performed":[151],"linear":[153],"time,":[154],"4-D":[158],"case":[159],"computed":[163],"O(n":[165,193],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[168,196],")":[169],"time.":[170],"As":[171],"consequence,":[173],"can":[181],"now":[182],"be":[183],"obtained":[184],"O(n(n":[186],"k)":[188],"+n":[189],"log":[190],"n)":[191],"(n":[197],"k))":[199],"time":[200],"=":[203,207],"3":[204],"4,":[208],"respectively.":[209],"Experimental":[210],"results":[211],"show":[212],"proposed":[215],"significantly":[217],"outperform":[218],"existing":[219],"ones.":[220]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}