{"id":"https://openalex.org/W4413216461","doi":"https://doi.org/10.1145/3712255.3726552","title":"Lazy Hypervolume Subset Selection Algorithm with Contributions Update","display_name":"Lazy Hypervolume Subset Selection Algorithm with Contributions Update","publication_year":2025,"publication_date":"2025-07-14","ids":{"openalex":"https://openalex.org/W4413216461","doi":"https://doi.org/10.1145/3712255.3726552"},"language":"en","primary_location":{"id":"doi:10.1145/3712255.3726552","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3712255.3726552","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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/A5011598685","display_name":"Andrzej Jaszkiewicz","orcid":"https://orcid.org/0000-0002-8337-888X"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Andrzej Jaszkiewicz","raw_affiliation_strings":["Faculty of Computing and Telecommunications, Poznan University of Technology, Poznan, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Computing and Telecommunications, Poznan University of Technology, Poznan, Poland","institution_ids":["https://openalex.org/I46597724"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090952989","display_name":"Piotr Zielniewicz","orcid":"https://orcid.org/0000-0001-6996-3671"},"institutions":[{"id":"https://openalex.org/I46597724","display_name":"Pozna\u0144 University of Technology","ror":"https://ror.org/00p7p3302","country_code":"PL","type":"education","lineage":["https://openalex.org/I46597724"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Piotr Zielniewicz","raw_affiliation_strings":["Faculty of Computing and Telecommunications, Poznan University of Technology, Poznan, Poland"],"affiliations":[{"raw_affiliation_string":"Faculty of Computing and Telecommunications, Poznan University of Technology, Poznan, Poland","institution_ids":["https://openalex.org/I46597724"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011598685"],"corresponding_institution_ids":["https://openalex.org/I46597724"],"apc_list":null,"apc_paid":null,"fwci":2.1795,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.87401575,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"223","last_page":"226"},"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.9990000128746033,"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.9990000128746033,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9988999962806702,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.697763204574585},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6864578723907471},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44996118545532227},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3549194037914276},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33711105585098267},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23715555667877197},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2193579077720642}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.697763204574585},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6864578723907471},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44996118545532227},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3549194037914276},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33711105585098267},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23715555667877197},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2193579077720642}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3712255.3726552","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3712255.3726552","pdf_url":null,"source":{"id":"https://openalex.org/S4363608771","display_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1480517346","https://openalex.org/W1680189815","https://openalex.org/W1817091417","https://openalex.org/W1898824936","https://openalex.org/W2050914643","https://openalex.org/W2098907614","https://openalex.org/W2106334424","https://openalex.org/W2108968575","https://openalex.org/W2239902130","https://openalex.org/W2434562129","https://openalex.org/W2736457838","https://openalex.org/W2898674122","https://openalex.org/W2962987192","https://openalex.org/W2963054067","https://openalex.org/W3046910774","https://openalex.org/W4245385137","https://openalex.org/W4411600409"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Hypervolume":[0,113],"subset":[1,53],"selection":[2,54],"(HSS)":[3],"is":[4,115],"an":[5],"important":[6],"problem":[7,39],"in":[8],"evolutionary":[9],"multiobjective":[10,38],"optimization":[11],"(EMO).":[12],"It":[13],"may":[14],"be":[15,87],"used":[16],"to":[17,21,26],"guide":[18],"EMO":[19],"algorithms,":[20],"bound":[22],"Pareto":[23],"archives,":[24],"or":[25],"select":[27],"a":[28,37,119],"reduced":[29],"set":[30],"of":[31,36,70,82,93,99],"the":[32,44,58,71,80,102,110],"most":[33],"representative":[34],"solutions":[35],"for":[40,62,117],"further":[41,88],"analysis":[42],"by":[43,90],"decision":[45],"maker.":[46],"Lazy":[47],"greedy":[48],"incremental":[49],"and":[50,67],"decremental":[51],"hypervolume":[52,96,135],"algorithms":[55,85],"are":[56,137],"currently":[57],"fastest":[59],"approximate":[60],"methods":[61],"more":[63],"than":[64],"4":[65],"objectives":[66],"moderate":[68],"sizes":[69],"candidate":[72],"sets.":[73],"In":[74],"this":[75],"paper,":[76],"we":[77],"show":[78,107],"that":[79,109],"efficiency":[81],"these":[83],"lazy":[84],"could":[86],"improved":[89],"adaptive":[91],"update":[92],"previously":[94],"calculated":[95],"contributions":[97,103,136],"instead":[98],"always":[100],"recalculating":[101],"from":[104],"scratch.":[105],"We":[106],"also":[108],"Improved":[111],"Quick":[112],"algorithm":[114],"well-suited":[116],"such":[118],"context":[120],"because":[121],"its":[122],"recursion":[123],"tree":[124],"does":[125],"not":[126],"depend":[127],"on":[128],"dominated":[129],"points":[130],"which":[131],"often":[132],"appear":[133],"when":[134],"updated.":[138]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}