{"id":"https://openalex.org/W1986507441","doi":"https://doi.org/10.1145/1527125.1527139","title":"Don't be greedy when calculating hypervolume contributions","display_name":"Don't be greedy when calculating hypervolume contributions","publication_year":2009,"publication_date":"2009-01-09","ids":{"openalex":"https://openalex.org/W1986507441","doi":"https://doi.org/10.1145/1527125.1527139","mag":"1986507441"},"language":"en","primary_location":{"id":"doi:10.1145/1527125.1527139","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1527125.1527139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms","raw_type":"proceedings-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/A5044394587","display_name":"Karl Bringmann","orcid":"https://orcid.org/0000-0003-1356-5177"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Universit\u00e4t des Saarlandes, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077389210","display_name":"Tobias Friedrich","orcid":"https://orcid.org/0000-0003-0076-6308"},"institutions":[{"id":"https://openalex.org/I1297971548","display_name":"International Computer Science Institute","ror":"https://ror.org/01ewh7m12","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1297971548"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tobias Friedrich","raw_affiliation_strings":["International Computer Science Institute, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"International Computer Science Institute, Berkeley, CA, USA","institution_ids":["https://openalex.org/I1297971548"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044394587"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":5.2855,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.95737252,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"103","last_page":"112"},"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.9998999834060669,"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.9998999834060669,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.6739010810852051},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.6565933227539062},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6147766709327698},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5749567747116089},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.5449837446212769},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.48876285552978516},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.45005935430526733},{"id":"https://openalex.org/keywords/binomial","display_name":"Binomial (polynomial)","score":0.4367104768753052},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40976572036743164},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3218788802623749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2879459261894226},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16119101643562317}],"concepts":[{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.6739010810852051},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.6565933227539062},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6147766709327698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5749567747116089},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.5449837446212769},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48876285552978516},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.45005935430526733},{"id":"https://openalex.org/C2781315470","wikidata":"https://www.wikidata.org/wiki/Q193623","display_name":"Binomial (polynomial)","level":2,"score":0.4367104768753052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40976572036743164},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3218788802623749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2879459261894226},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16119101643562317},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1527125.1527139","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1527125.1527139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.217.6069","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.6069","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-sb.mpg.de/~tfried/paper/2009FOGA_Hyp.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:518330","is_oa":false,"landing_page_url":"http://edoc.mpg.de/518330","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jansen, Thomas; Garibay, Ivan; Paul, Wiegand R.; Wu, Annie S.: Proceedings of the 10th International Workshop on Foundations of Genetic Algorithms (FOGA 2009), ACM, 103-112 (2009)","raw_type":"Conference-Paper"},{"id":"pmh:oai:pure.mpg.de:item_1324096","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-182F-5","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the 10th International Workshop on Foundations of Genetic Algorithms","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W90390084","https://openalex.org/W160321423","https://openalex.org/W1491287429","https://openalex.org/W1496912583","https://openalex.org/W1525375343","https://openalex.org/W1558919105","https://openalex.org/W1564638059","https://openalex.org/W1588375755","https://openalex.org/W1613794742","https://openalex.org/W1657799094","https://openalex.org/W1846834309","https://openalex.org/W2038420231","https://openalex.org/W2098907614","https://openalex.org/W2106334424","https://openalex.org/W2116938494","https://openalex.org/W2127474646","https://openalex.org/W2138075238","https://openalex.org/W2142331156","https://openalex.org/W2151953637","https://openalex.org/W2153654820","https://openalex.org/W2156784823","https://openalex.org/W2160088187","https://openalex.org/W2794503197","https://openalex.org/W3122481131"],"related_works":["https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W1531601525","https://openalex.org/W2890245854","https://openalex.org/W4297002096","https://openalex.org/W3007163443","https://openalex.org/W1488668796"],"abstract_inverted_index":{"Most":[0],"hypervolume":[1,35,68,86,103,115,169],"indicator":[2],"based":[3],"optimization":[4],"algorithms":[5,187],"like":[6],"SIBEA":[7],"[Zitzler":[8],"et":[9,14,20],"al.":[10,15,21],"2007],":[11,16],"SMS-EMOA":[12],"[Beume":[13],"or":[17],"MO-CMA-ES":[18],"[Igel":[19],"2007]":[22],"remove":[23,201],"the":[24,27,33,37,46,49,66,70,84,95,113,120,137,140,202],"solution":[25],"with":[26,30,166],"smallest":[28],"loss":[29],"respect":[31],"to":[32],"dominated":[34],"from":[36],"population.":[38],"This":[39,128,182],"is":[40,106],"usually":[41],"iterated":[42],"\u03bb":[43,71,92,126],"times":[44],"until":[45],"size":[47,56,155],"of":[48,69,87,91,122,125,133,139,143,147,154,163,191,215],"population":[50,153],"no":[51],"longer":[52],"exceeds":[53],"a":[54,144,152,161,189,212],"fixed":[55],"\u03bc.":[57],"We":[58,111],"show":[59],"that":[60,65],"there":[61],"are":[62],"populations":[63],"such":[64],"contributing":[67,85],"solutions":[72,165,203],"chosen":[73],"by":[74,188,205],"this":[75],"greedy":[76],"selection":[77],"scheme":[78],"can":[79,159],"be":[80],"much":[81],"smaller":[82],"than":[83],"an":[88,130],"optimal":[89,96],"set":[90,124,162],"solutions.":[93,127],"Selecting":[94],"\u03bb-set":[97],"implies":[98],"calculating":[99],"(\u03bc+\u03bb":[100,134],"over":[101,135,149],"\u03bc)conventional":[102],"contributions,":[104],"which":[105,117],"considered":[107],"computationally":[108],"too":[109],"expensive.":[110],"present":[112],"first":[114],"algorithm":[116,158],"calculates":[118],"directly":[119],"contribution":[121,170],"every":[123],"gives":[129],"additive":[131],"term":[132],"\u03bc)in":[136],"runtime":[138],"calculation":[141],"instead":[142],"multiplicative":[145],"factor":[146,190,214],"binomial(\u03bc+\u03bb":[148],"\u03bc).":[150],"Given":[151],"n=\u03bc+\u03bb,":[156],"our":[157],"calculate":[160],"\u03bb\u2265":[164],"minimal":[167],"d-dimensional":[168],"in":[171],"time":[172],"O(nd/2":[173],"log":[174],"+":[175],"n":[176,216],"\u03bb)":[177],"for":[178,194,217],"d":[179,195,219],">":[180,220],"2.":[181],"improves":[183],"all":[184,218],"previously":[185],"published":[186],"order":[192],"nmin(\u03bb,,d/2":[193],">3.":[196],"Therefore":[197],"even":[198],"if":[199],"we":[200,210],"one":[204,206],"greedily":[207],"as":[208],"usual,":[209],"gain":[211],"speedup":[213],"3.":[221]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}