{"id":"https://openalex.org/W4206965649","doi":"https://doi.org/10.1109/tevc.2022.3145631","title":"Space-Partitioned ND-Trees for the Dynamic Nondominance Problem","display_name":"Space-Partitioned ND-Trees for the Dynamic Nondominance Problem","publication_year":2022,"publication_date":"2022-01-24","ids":{"openalex":"https://openalex.org/W4206965649","doi":"https://doi.org/10.1109/tevc.2022.3145631"},"language":"en","primary_location":{"id":"doi:10.1109/tevc.2022.3145631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2022.3145631","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/A5070913387","display_name":"Bruno Lang","orcid":"https://orcid.org/0000-0001-9197-4836"},"institutions":[{"id":"https://openalex.org/I167360494","display_name":"University of Wuppertal","ror":"https://ror.org/00613ak93","country_code":"DE","type":"education","lineage":["https://openalex.org/I167360494"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Bruno Lang","raw_affiliation_strings":["IMACM and Scientific Computing, Bergische Universität Wuppertal, Wuppertal, Germany"],"affiliations":[{"raw_affiliation_string":"IMACM and Scientific Computing, Bergische Universität Wuppertal, Wuppertal, Germany","institution_ids":["https://openalex.org/I167360494"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5070913387"],"corresponding_institution_ids":["https://openalex.org/I167360494"],"apc_list":null,"apc_paid":null,"fwci":1.0226,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.77884253,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"26","issue":"5","first_page":"1004","last_page":"1014"},"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.9957000017166138,"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.9957000017166138,"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/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9872999787330627,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/tree","display_name":"Tree (set theory)","score":0.6582765579223633},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5606440305709839},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5483551025390625},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5068872570991516},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4985172748565674},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4733448326587677},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.4468497037887573},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41009005904197693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40440475940704346},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39736050367355347},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3366738557815552},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2516705095767975},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15095677971839905},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.13513678312301636}],"concepts":[{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6582765579223633},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5606440305709839},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5483551025390625},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5068872570991516},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4985172748565674},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4733448326587677},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.4468497037887573},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41009005904197693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40440475940704346},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39736050367355347},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3366738557815552},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2516705095767975},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15095677971839905},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.13513678312301636},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tevc.2022.3145631","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tevc.2022.3145631","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":28,"referenced_works":["https://openalex.org/W157819696","https://openalex.org/W302386071","https://openalex.org/W1585939719","https://openalex.org/W1670300334","https://openalex.org/W1755555095","https://openalex.org/W1823686600","https://openalex.org/W2022485595","https://openalex.org/W2024008934","https://openalex.org/W2085507535","https://openalex.org/W2089370129","https://openalex.org/W2095420020","https://openalex.org/W2102365077","https://openalex.org/W2109778277","https://openalex.org/W2126105956","https://openalex.org/W2126328942","https://openalex.org/W2143381319","https://openalex.org/W2165558283","https://openalex.org/W2518870586","https://openalex.org/W2767528495","https://openalex.org/W2911302472","https://openalex.org/W2951774549","https://openalex.org/W3021613070","https://openalex.org/W3021855001","https://openalex.org/W3036913896","https://openalex.org/W4246219036","https://openalex.org/W4298410530","https://openalex.org/W6628770400","https://openalex.org/W6635097213"],"related_works":["https://openalex.org/W1985727224","https://openalex.org/W3128587426","https://openalex.org/W2227684440","https://openalex.org/W2739550867","https://openalex.org/W2156833871","https://openalex.org/W2359807192","https://openalex.org/W2174962524","https://openalex.org/W2157743338","https://openalex.org/W2083751087","https://openalex.org/W48124421"],"abstract_inverted_index":{"We":[0,25],"present":[1],"techniques":[2],"for":[3,18,28,61,72,97],"improving":[4],"the":[5,10,13,53,63,74,82],"efficiency":[6],"of":[7,12,35,76],"ND-trees":[8],"in":[9,68,80,95],"solution":[11],"dynamic":[14],"nondominance":[15],"problem,":[16],"i.e.,":[17],"building":[19],"and":[20,65,71],"maintaining":[21],"a":[22,30,33,40,45],"Pareto":[23],"archive.":[24],"propose":[26],"algorithms":[27],"(re)building":[29],"tree":[31,54],"from":[32],"set":[34],"nondominated":[36],"points,":[37],"either":[38],"as":[39],"space-partitioned":[41],"ND-tree":[42],"or":[43],"by":[44],"clustering":[46],"approach.":[47],"Numerical":[48],"experiments":[49],"confirm":[50],"that":[51],"rebuilding":[52],"at":[55],"intervals,":[56],"combined":[57],"with":[58],"modified":[59],"strategies":[60],"updating":[62],"lower":[64],"upper":[66],"bounds":[67],"each":[69],"node":[70],"computing":[73],"distances":[75],"points":[77],"to":[78,86],"subtrees":[79],"between":[81],"rebuilds,":[83],"can":[84],"lead":[85],"significant":[87],"speedups":[88],"over":[89],"using":[90],"plain":[91],"ND-tree-based":[92],"updates":[93],"throughout,":[94],"particular":[96],"higher":[98],"dimensions.":[99]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}