{"id":"https://openalex.org/W2767528495","doi":"https://doi.org/10.1109/tevc.2018.2799684","title":"ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem","display_name":"ND-Tree-Based Update: A Fast Algorithm for the Dynamic Nondominance Problem","publication_year":2018,"publication_date":"2018-01-30","ids":{"openalex":"https://openalex.org/W2767528495","doi":"https://doi.org/10.1109/tevc.2018.2799684","mag":"2767528495"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2018.2799684","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2018.2799684","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1603.04798","any_repository_has_fulltext":true},"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":false,"raw_author_name":"Andrzej Jaszkiewicz","raw_affiliation_strings":["Faculty of Computing, Institute of Computing Science, Poznan University of Technology, Poznan, Poland","Institute of Computing Science [Poznan] (ul. Piotrowo 2, 60-965 Poznan, Poland - Pologne)"],"raw_orcid":"https://orcid.org/0000-0002-8337-888X","affiliations":[{"raw_affiliation_string":"Faculty of Computing, Institute of Computing Science, Poznan University of Technology, Poznan, Poland","institution_ids":["https://openalex.org/I46597724"]},{"raw_affiliation_string":"Institute of Computing Science [Poznan] (ul. Piotrowo 2, 60-965 Poznan, Poland - Pologne)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054715902","display_name":"Thibaut Lust","orcid":"https://orcid.org/0000-0001-8433-518X"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I39804081","display_name":"Sorbonne Universit\u00e9","ror":"https://ror.org/02en5vm52","country_code":"FR","type":"education","lineage":["https://openalex.org/I39804081"]},{"id":"https://openalex.org/I4210159731","display_name":"LIP6","ror":"https://ror.org/05krcen59","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I39804081","https://openalex.org/I4210159245","https://openalex.org/I4210159731"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thibaut Lust","raw_affiliation_strings":["CNRS, LIP6, UMR 7606, UPMC, Universit\u00e9 Paris 06, Sorbonne University, Paris, France","DECISION (France)"],"raw_orcid":"https://orcid.org/0000-0001-8433-518X","affiliations":[{"raw_affiliation_string":"CNRS, LIP6, UMR 7606, UPMC, Universit\u00e9 Paris 06, Sorbonne University, Paris, France","institution_ids":["https://openalex.org/I39804081","https://openalex.org/I204730241","https://openalex.org/I1294671590","https://openalex.org/I4210159731"]},{"raw_affiliation_string":"DECISION (France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.717,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.94371669,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"22","issue":"5","first_page":"778","last_page":"791"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9879999756813049,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9879999756813049,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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.5948916673660278},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5165216326713562},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4884409010410309},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2699090838432312},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.09301617741584778}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5948916673660278},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5165216326713562},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4884409010410309},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2699090838432312},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.09301617741584778}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tevc.2018.2799684","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2018.2799684","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"},{"id":"pmh:oai:arXiv.org:1603.04798","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.04798","pdf_url":"https://arxiv.org/pdf/1603.04798","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:HAL:hal-02076624v1","is_oa":false,"landing_page_url":"https://hal.sorbonne-universite.fr/hal-02076624","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Evolutionary Computation, 2018, 22 (5), pp.778-791. ⟨10.1109/TEVC.2018.2799684⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1603.04798","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1603.04798","pdf_url":"https://arxiv.org/pdf/1603.04798","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W143013833","https://openalex.org/W157819696","https://openalex.org/W1485910948","https://openalex.org/W1585939719","https://openalex.org/W1670300334","https://openalex.org/W1755555095","https://openalex.org/W1823686600","https://openalex.org/W1833634424","https://openalex.org/W1979109797","https://openalex.org/W2005314985","https://openalex.org/W2016014758","https://openalex.org/W2022485595","https://openalex.org/W2022719070","https://openalex.org/W2028772559","https://openalex.org/W2049864887","https://openalex.org/W2054509091","https://openalex.org/W2071694551","https://openalex.org/W2105511939","https://openalex.org/W2106483164","https://openalex.org/W2109778277","https://openalex.org/W2123497782","https://openalex.org/W2126105956","https://openalex.org/W2126997347","https://openalex.org/W2128669740","https://openalex.org/W2143381319","https://openalex.org/W2148616821","https://openalex.org/W2165171393","https://openalex.org/W2312339748","https://openalex.org/W2352407177","https://openalex.org/W2489698835","https://openalex.org/W2911302472","https://openalex.org/W3041834803","https://openalex.org/W4285719527","https://openalex.org/W4297917482","https://openalex.org/W6605818128","https://openalex.org/W6635097213","https://openalex.org/W6637579652","https://openalex.org/W6644866396","https://openalex.org/W6722617911"],"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":{"In":[0],"this":[1,152,192],"paper,":[2],"we":[3,83,170],"propose":[4],"a":[5,24,34,44,50],"new":[6,35,153],"method":[7,154,173],"called":[8],"ND-Tree-based":[9],"update":[10,22,106],"(ND-Tree)":[11],"for":[12],"the":[13,18,69,77,91,116,131,158,172,175],"dynamic":[14],"nondominance":[15],"problem,":[16],"i.e.,":[17],"problem":[19,178],"of":[20,23,28,46,76,109,157,160],"online":[21],"Pareto":[25],"archive":[26,108],"composed":[27],"mutually":[29],"nondominated":[30,111,176],"points.":[31,60,112],"It":[32],"uses":[33],"ND-Tree":[36,93,129],"data":[37],"structure":[38],"in":[39,49,68,90,97],"which":[40],"each":[41],"node":[42],"represents":[43],"subset":[45],"points":[47,65,82],"contained":[48],"hyperrectangle":[51],"defined":[52],"by":[53],"its":[54],"local":[55,78],"approximate":[56],"ideal":[57,79],"and":[58,72,80,101,135,140,148,163],"nadir":[59,81],"By":[61],"building":[62],"subsets":[63],"containing":[64],"located":[66],"close":[67],"objective":[70],"space":[71],"using":[73,138],"basic":[74],"properties":[75],"can":[84,166],"efficiently":[85],"avoid":[86],"searching":[87],"many":[88],"branches":[89],"tree.":[92],"may":[94],"be":[95,167],"used":[96],"multiobjective":[98,103],"evolutionary":[99],"algorithms":[100,189],"other":[102],"metaheuristics":[104],"to":[105,130,145,174,185,191],"an":[107],"potentially":[110],"We":[113,126],"prove":[114],"that":[115,150,180],"proposed":[117,188],"algorithm":[118],"has":[119],"sublinear":[120],"time":[121,165],"complexity":[122],"under":[123],"mild":[124],"assumptions.":[125],"experimentally":[127],"compare":[128],"simple":[132],"list,":[133],"Quad-tree,":[134],"M-Front":[136],"methods":[137],"artificial":[139],"realistic":[141],"benchmarks":[142],"with":[143,151],"up":[144],"ten":[146],"objectives":[147],"show":[149],"substantial":[155],"reduction":[156],"number":[159],"point":[161],"comparisons":[162],"computational":[164],"obtained.":[168],"Furthermore,":[169],"apply":[171],"sorting":[177],"showing":[179],"it":[181],"is":[182],"highly":[183],"competitive":[184],"some":[186],"recently":[187],"dedicated":[190],"problem.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}