{"id":"https://openalex.org/W4385188919","doi":"https://doi.org/10.1145/3583133.3590607","title":"Variable neighborhood search for solving the k-domination problem","display_name":"Variable neighborhood search for solving the k-domination problem","publication_year":2023,"publication_date":"2023-07-15","ids":{"openalex":"https://openalex.org/W4385188919","doi":"https://doi.org/10.1145/3583133.3590607"},"language":"en","primary_location":{"id":"doi:10.1145/3583133.3590607","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3583133.3590607","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3583133.3590607&file=p239-predojevic-suppl.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3583133.3590607&file=p239-predojevic-suppl.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089050421","display_name":"Milan Predojevi\u0107","orcid":"https://orcid.org/0009-0008-6881-0196"},"institutions":[{"id":"https://openalex.org/I173887773","display_name":"University of Banja Luka","ror":"https://ror.org/0282m7c06","country_code":"BA","type":"education","lineage":["https://openalex.org/I173887773"]}],"countries":["BA"],"is_corresponding":true,"raw_author_name":"Milan Predojevi\u0107","raw_affiliation_strings":["University of Banja Luka, Banja Luka, Bosnia and Herzegovina"],"affiliations":[{"raw_affiliation_string":"University of Banja Luka, Banja Luka, Bosnia and Herzegovina","institution_ids":["https://openalex.org/I173887773"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083774363","display_name":"Aleksandar Kartelj","orcid":"https://orcid.org/0000-0001-9839-6039"},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Aleksandar Kartelj","raw_affiliation_strings":["University of Belgrade, Belgrade, Serbia & Montenegro"],"affiliations":[{"raw_affiliation_string":"University of Belgrade, Belgrade, Serbia & Montenegro","institution_ids":["https://openalex.org/I4068193"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111191723","display_name":"Marko Djukanovi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I173887773","display_name":"University of Banja Luka","ror":"https://ror.org/0282m7c06","country_code":"BA","type":"education","lineage":["https://openalex.org/I173887773"]}],"countries":["BA"],"is_corresponding":false,"raw_author_name":"Marko Djukanovi\u0107","raw_affiliation_strings":["University of Banja Luka, Banja Luka, Bosnia and Herzegovina"],"affiliations":[{"raw_affiliation_string":"University of Banja Luka, Banja Luka, Bosnia and Herzegovina","institution_ids":["https://openalex.org/I173887773"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089050421"],"corresponding_institution_ids":["https://openalex.org/I173887773"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1500577,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"239","last_page":"242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9977999925613403,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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/T12288","display_name":"Optimization and Search Problems","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.7304718494415283},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6332671642303467},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6127236485481262},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5776286721229553},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5415778756141663},{"id":"https://openalex.org/keywords/dominating-set","display_name":"Dominating set","score":0.5221907496452332},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5123265981674194},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5045269727706909},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.4659733772277832},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44106799364089966},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.4407835304737091},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4361836314201355},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42624229192733765},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31004080176353455},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.1261833906173706}],"concepts":[{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.7304718494415283},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6332671642303467},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6127236485481262},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5776286721229553},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5415778756141663},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.5221907496452332},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5123265981674194},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5045269727706909},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.4659733772277832},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44106799364089966},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.4407835304737091},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4361836314201355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42624229192733765},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31004080176353455},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.1261833906173706},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","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":1,"locations":[{"id":"doi:10.1145/3583133.3590607","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3583133.3590607","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3583133.3590607&file=p239-predojevic-suppl.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3583133.3590607","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1145/3583133.3590607","pdf_url":"https://dl.acm.org/action/downloadSupplement?doi=10.1145%2F3583133.3590607&file=p239-predojevic-suppl.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.8299999833106995,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4385188919.pdf","grobid_xml":"https://content.openalex.org/works/W4385188919.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W91480404","https://openalex.org/W1487719891","https://openalex.org/W1493071618","https://openalex.org/W1539453972","https://openalex.org/W1601663005","https://openalex.org/W1974300423","https://openalex.org/W1976882237","https://openalex.org/W1986858995","https://openalex.org/W1999216089","https://openalex.org/W2069001474","https://openalex.org/W2070684734","https://openalex.org/W2072173547","https://openalex.org/W2225916722","https://openalex.org/W2611770526","https://openalex.org/W2739708782","https://openalex.org/W2917331228","https://openalex.org/W2920639560","https://openalex.org/W2947906071","https://openalex.org/W3113248774","https://openalex.org/W3162360869"],"related_works":["https://openalex.org/W4312677050","https://openalex.org/W4287795162","https://openalex.org/W3023069363","https://openalex.org/W2006009875","https://openalex.org/W2388573368","https://openalex.org/W2166530698","https://openalex.org/W2087307827","https://openalex.org/W2045858576","https://openalex.org/W2104330975","https://openalex.org/W2071807082"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"are":[4,115,144],"concerned":[5],"with":[6,89,171],"solving":[7,81],"a":[8,30,38,74,118,147],"generalized":[9],"version":[10],"of":[11,35,37,112,157],"the":[12,18,82,113,127,133,135,154],"well-known":[13],"minimum":[14],"dominating":[15],"set":[16,150],"problem,":[17,21],"so-called":[19],"k-domination":[20,62,83],"k":[22,57,172],"\u2208":[23,48,173],"\u2115.":[24],"This":[25],"problem":[26,63,169],"is":[27,87,124],"about":[28],"finding":[29],"minimal":[31],"cardinality":[32],"subset":[33],"D":[34,52],"vertices":[36],"graph":[39],"G":[40],"=":[41],"(V,":[42],"E)":[43],"such":[44],"that":[45,94],"every":[46],"\u03c5":[47],"V":[49],"belongs":[50],"to":[51,97,126],"or":[53],"has":[54,64],"at":[55],"least":[56],"neighbors":[58],"from":[59,132],"D.":[60],"The":[61,85,109,122,160],"applications":[65],"in":[66],"distributed":[67],"systems,":[68],"biological":[69],"networks":[70,156],"etc.":[71],"We":[72],"propose":[73],"variable":[75],"neighborhood":[76],"search":[77,120,137],"(VNS)":[78],"metaheuristic":[79],"for":[80,166],"problem.":[84],"Vns":[86,114,161],"equipped":[88],"an":[90],"efficient":[91],"fitness":[92],"function":[93],"allows":[95],"it":[96],"consider":[98],"both":[99],"feasible":[100],"and":[101,138],"infeasible":[102,107],"solutions,":[103],"while":[104],"appropriately":[105],"penalizing":[106],"solutions.":[108],"control":[110],"parameters":[111],"tuned":[116],"using":[117],"grid":[119],"approach.":[121],"method":[123],"compared":[125],"best":[128],"known":[129],"heuristic":[130],"approaches":[131],"literature:":[134],"beam":[136],"several":[139],"greedy":[140],"approaches.":[141],"Experimental":[142],"evaluations":[143],"performed":[145],"on":[146],"real-world":[148],"benchmark":[149],"whose":[151],"instances":[152,170],"represent":[153],"road":[155],"different":[158],"cities.":[159],"provided":[162],"new":[163],"state-of-the-art":[164],"results":[165],"all":[167],"considered":[168],"{1,":[174],"2,":[175],"4}.":[176]},"counts_by_year":[],"updated_date":"2025-12-24T23:09:58.560324","created_date":"2025-10-10T00:00:00"}