{"id":"https://openalex.org/W2947965830","doi":"https://doi.org/10.31577/cai_2019_1_57","title":"Variable Neighborhood Search Approach for Solving Roman and Weak Roman Domination Problems on Graphs","display_name":"Variable Neighborhood Search Approach for Solving Roman and Weak Roman Domination Problems on Graphs","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2947965830","doi":"https://doi.org/10.31577/cai_2019_1_57","mag":"2947965830"},"language":"en","primary_location":{"id":"doi:10.31577/cai_2019_1_57","is_oa":true,"landing_page_url":"https://doi.org/10.31577/cai_2019_1_57","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.31577/cai_2019_1_57","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071196633","display_name":"Marija Ivanovi\u0107","orcid":"https://orcid.org/0000-0002-3372-8271"},"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":true,"raw_author_name":"Marija Ivanovi\u0107","raw_affiliation_strings":["Faculty of Mathematics, University of Belgrade"],"affiliations":[{"raw_affiliation_string":"Faculty of Mathematics, University of Belgrade","institution_ids":["https://openalex.org/I4068193"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033061003","display_name":"Dragan Uro\u0161evi\u0107","orcid":"https://orcid.org/0000-0003-3607-6704"},"institutions":[{"id":"https://openalex.org/I4210120676","display_name":"Mathematical Institute of the Slovak Academy of Sciences","ror":"https://ror.org/02fhy7464","country_code":"SK","type":"facility","lineage":["https://openalex.org/I207624831","https://openalex.org/I4210120676"]},{"id":"https://openalex.org/I4390039372","display_name":"Mathematical Institute of the Serbian Academy of Sciences and Arts","ror":"https://ror.org/02jxk1021","country_code":null,"type":"education","lineage":["https://openalex.org/I1338511612","https://openalex.org/I4390039372"]}],"countries":["SK"],"is_corresponding":false,"raw_author_name":"Dragan Uro\u0161evi\u0107","raw_affiliation_strings":["Mathematical Institute SANU, Belgrade"],"affiliations":[{"raw_affiliation_string":"Mathematical Institute SANU, Belgrade","institution_ids":["https://openalex.org/I4210120676","https://openalex.org/I4390039372"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071196633"],"corresponding_institution_ids":["https://openalex.org/I4068193"],"apc_list":null,"apc_paid":null,"fwci":0.2175,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.59849912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"38","issue":"1","first_page":"57","last_page":"84"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.8596000075340271,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.8596000075340271,"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"}},{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.8472999930381775,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.7684000134468079,"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/variable-neighborhood-search","display_name":"Variable neighborhood search","score":0.7739875316619873},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7067499160766602},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.6292710304260254},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.6233654618263245},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5902612805366516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5651634931564331},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.39286261796951294},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.383327454328537},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.17883890867233276},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09300044178962708}],"concepts":[{"id":"https://openalex.org/C2776435737","wikidata":"https://www.wikidata.org/wiki/Q7915703","display_name":"Variable neighborhood search","level":3,"score":0.7739875316619873},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7067499160766602},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.6292710304260254},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.6233654618263245},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5902612805366516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5651634931564331},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39286261796951294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.383327454328537},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.17883890867233276},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09300044178962708},{"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.31577/cai_2019_1_57","is_oa":true,"landing_page_url":"https://doi.org/10.31577/cai_2019_1_57","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.31577/cai_2019_1_57","is_oa":true,"landing_page_url":"https://doi.org/10.31577/cai_2019_1_57","pdf_url":null,"source":{"id":"https://openalex.org/S4210200093","display_name":"Computing and Informatics","issn_l":"1335-9150","issn":["1335-9150","2585-8807"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computing and Informatics","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.6800000071525574,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W2362558149","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W4288278856","https://openalex.org/W2572370460"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"Roman":[3,6],"and":[4],"weak":[5],"domination":[7],"problems":[8,16],"on":[9,25,38,64],"graphs":[10],"are":[11,17],"considered.":[12],"Given":[13],"that":[14],"both":[15],"NP":[18],"hard,":[19],"a":[20,26,86],"new":[21],"heuristic":[22],"approach,":[23],"based":[24],"Variable":[27],"Neighborhood":[28],"Search":[29],"(VNS),":[30],"is":[31,36,52,74],"presented.":[32],"The":[33,49],"presented":[34],"algorithm":[35,100],"tested":[37],"instances":[39,68,81],"known":[40],"from":[41],"the":[42,65,70,78,98],"literature,":[43],"with":[44],"up":[45],"to":[46,58,92,95],"600":[47],"vertices.":[48],"VNS":[50,99],"approach":[51],"justified":[53],"since":[54],"it":[55,94],"was":[56],"able":[57],"achieve":[59],"an":[60,102],"optimal":[61,71],"solution":[62,72,87,105],"value":[63,73,88],"majority":[66,79],"of":[67,80],"where":[69,82],"known.":[75],"Also,":[76],"for":[77],"optimization":[83],"solvers":[84],"found":[85],"but":[89],"were":[90],"unable":[91],"prove":[93],"be":[96],"optimal,":[97],"achieves":[101],"even":[103],"better":[104],"value.":[106]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}