{"id":"https://openalex.org/W7224853102","doi":"https://doi.org/10.1080/0305215x.2026.2703597","title":"A local search algorithm based on non-dominated sorting for the minimum weight minimum connected dominating set problem","display_name":"A local search algorithm based on non-dominated sorting for the minimum weight minimum connected dominating set problem","publication_year":2026,"publication_date":"2026-10-30","ids":{"openalex":"https://openalex.org/W7224853102","doi":"https://doi.org/10.1080/0305215x.2026.2703597"},"language":"en","primary_location":{"id":"doi:10.1080/0305215x.2026.2703597","doi":"https://doi.org/10.1080/0305215x.2026.2703597","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0305215x.2026.2703597","pdf_url":null,"source":{"id":"https://openalex.org/S139857051","display_name":"Engineering Optimization","issn_l":"0305-215X","issn":["0305-215X","1026-745X","1029-0273"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Engineering Optimization","raw_type":"journal-article"},"volume":null,"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/A5057791469","display_name":"Hayet Dahmri","orcid":"https://orcid.org/0000-0001-9791-309X","observed_orcids":["https://orcid.org/0000-0001-9791-309X"]},"institutions":[{"id":"https://openalex.org/I40193446","display_name":"University Ferhat Abbas of Setif","ror":"https://ror.org/02rzqza52","country_code":"DZ","type":"education","lineage":["https://openalex.org/I40193446"]}],"countries":["DZ"],"is_corresponding":true,"raw_author_name":"Hayet Dahmri","raw_affiliation_strings":["S\u00e9tif 1 University -- Ferhat Abbas"],"raw_orcid":"https://orcid.org/0000-0001-9791-309X","affiliations":[{"raw_affiliation_string":"S\u00e9tif 1 University -- Ferhat Abbas","institution_ids":["https://openalex.org/I40193446"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055774416","display_name":"Salim Bouamama","orcid":"https://orcid.org/0000-0002-5842-2850","observed_orcids":["https://orcid.org/0000-0002-5842-2850"]},"institutions":[{"id":"https://openalex.org/I40193446","display_name":"University Ferhat Abbas of Setif","ror":"https://ror.org/02rzqza52","country_code":"DZ","type":"education","lineage":["https://openalex.org/I40193446"]}],"countries":["DZ"],"is_corresponding":false,"raw_author_name":"Salim Bouamama","raw_affiliation_strings":["S\u00e9tif 1 University -- Ferhat Abbas"],"raw_orcid":"https://orcid.org/0000-0002-5842-2850","affiliations":[{"raw_affiliation_string":"S\u00e9tif 1 University -- Ferhat Abbas","institution_ids":["https://openalex.org/I40193446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057791469"],"corresponding_institution_ids":["https://openalex.org/I40193446"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.85728822,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"25"},"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.923799991607666,"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.923799991607666,"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.03579999879002571,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.016899999231100082,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/bi-objective-optimization","display_name":"bi-objective optimization","score":0.8420000076293945},{"id":"https://openalex.org/keywords/non-dominated-sorting","display_name":"non-dominated sorting","score":0.9810000061988831},{"id":"https://openalex.org/keywords/crowding-distance","display_name":"crowding distance","score":0.9909999966621399},{"id":"https://openalex.org/keywords/pareto-front-approximation","display_name":"Pareto front approximation","score":0.9549999833106995},{"id":"https://openalex.org/keywords/np-hard-combinatorial-optimization","display_name":"NP-hard combinatorial optimization","score":0.8539999723434448}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7764000296592712},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5958999991416931},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5842000246047974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5766000151634216},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5497000217437744},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.5364999771118164},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5260999798774719},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5239999890327454},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5091000199317932},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4311999976634979},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.40540000796318054},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.3898000121116638},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3736000061035156},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.3384000062942505},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.3359000086784363},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.33550000190734863},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.32260000705718994},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.3068999946117401},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.30300000309944153},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.29760000109672546},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.28060001134872437},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.2754000127315521},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.275299996137619},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.27129998803138733},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2565000057220459}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/0305215x.2026.2703597","doi":"https://doi.org/10.1080/0305215x.2026.2703597","is_oa":false,"landing_page_url":"https://doi.org/10.1080/0305215x.2026.2703597","pdf_url":null,"source":{"id":"https://openalex.org/S139857051","display_name":"Engineering Optimization","issn_l":"0305-215X","issn":["0305-215X","1026-745X","1029-0273"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547","https://openalex.org/P4310320449"],"host_organization_lineage_names":["Taylor & Francis","Informa"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Engineering Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1970026476","https://openalex.org/W1978232925","https://openalex.org/W1992476288","https://openalex.org/W2047496769","https://openalex.org/W2083286483","https://openalex.org/W2095970239","https://openalex.org/W2118382442","https://openalex.org/W2126105956","https://openalex.org/W2128001278","https://openalex.org/W2139023178","https://openalex.org/W2143381319","https://openalex.org/W2149736824","https://openalex.org/W2149780759","https://openalex.org/W2437431645","https://openalex.org/W2518309745","https://openalex.org/W2640205229","https://openalex.org/W2787004303","https://openalex.org/W2794011024","https://openalex.org/W2901497798","https://openalex.org/W2947164271","https://openalex.org/W3083573808","https://openalex.org/W3141863997","https://openalex.org/W3160441411","https://openalex.org/W3194751831","https://openalex.org/W3213046113","https://openalex.org/W4241727697","https://openalex.org/W4249816779","https://openalex.org/W4285392667","https://openalex.org/W4387432386","https://openalex.org/W4401831344","https://openalex.org/W4401905390","https://openalex.org/W4403311599","https://openalex.org/W4403980457","https://openalex.org/W4406263160","https://openalex.org/W4407588543","https://openalex.org/W4414539099","https://openalex.org/W7117319500","https://openalex.org/W7125965444"],"related_works":["https://openalex.org/W4403311599","https://openalex.org/W3083573808","https://openalex.org/W4390041237","https://openalex.org/W4400642198","https://openalex.org/W4391466683","https://openalex.org/W4413011325","https://openalex.org/W3213046113","https://openalex.org/W2437431645","https://openalex.org/W2947164271","https://openalex.org/W3194751831"],"abstract_inverted_index":{"Optimization":[0],"problems":[1],"in":[2],"practice":[3],"often":[4],"involve":[5],"multiple":[6,122],"conflicting":[7],"objectives,":[8],"which":[9],"has":[10],"motivated":[11],"extensive":[12],"research":[13],"into":[14],"multiobjective":[15],"algorithms.":[16],"In":[17],"this":[18],"work,":[19],"the":[20,36,39,44,91,94],"bi-objective":[21],"minimum":[22,24],"weight":[23],"connected":[25,40],"dominating":[26,41],"set":[27,42],"problem,":[28],"an":[29],"NP-hard":[30],"combinatorial":[31],"problem":[32],"that":[33,110],"jointly":[34],"minimizes":[35],"size":[37],"of":[38,46,71],"and":[43,89,99,115,125],"sum":[45],"its":[47],"associated":[48],"edge":[49],"weights,":[50],"is":[51,62],"addressed.":[52],"A":[53],"novel":[54],"algorithm,":[55],"called":[56],"Non-dominated":[57],"Sorting":[58],"Local":[59],"Search":[60],"(NSLS),":[61],"proposed.":[63],"The":[64],"method":[65],"begins":[66],"with":[67],"a":[68,77],"semi-greedy":[69],"construction":[70],"diverse":[72],"initial":[73],"solutions,":[74],"followed":[75],"by":[76],"randomized":[78],"greedy":[79],"local":[80],"search":[81],"procedure":[82],"to":[83],"improve":[84],"them.":[85],"To":[86],"preserve":[87],"diversity":[88],"approximate":[90],"Pareto":[92],"front,":[93],"algorithm":[95],"incorporates":[96],"non-dominated":[97],"sorting":[98],"crowding":[100],"distance":[101],"measures.":[102],"Experimental":[103],"results":[104],"on":[105],"standard":[106],"benchmark":[107],"instances":[108],"show":[109],"NSLS":[111],"achieves":[112],"competitive":[113],"performance":[114],"consistently":[116],"outperforms":[117],"several":[118],"state-of-the-art":[119],"algorithms":[120],"across":[121],"evaluation":[123],"metrics":[124],"statistical":[126],"tests.":[127]},"counts_by_year":[],"updated_date":"2026-11-01T11:40:01.658920","created_date":"2026-10-31T00:00:00"}