DC FieldValueLanguage
dc.contributor.authorIvanović, Marijaen
dc.contributor.authorUrošević, Draganen
dc.date.accessioned2020-05-01T20:13:52Z-
dc.date.available2020-05-01T20:13:52Z-
dc.date.issued2019-01-01en
dc.identifier.issn1335-9150en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1760-
dc.description.abstractIn this paper Roman and weak Roman domination problems on graphs are considered. Given that both problems are NP hard, a new heuristic approach, based on a Variable Neighborhood Search (VNS), is presented. The presented algorithm is tested on instances known from the literature, with up to 600 vertices. The VNS approach is justified since it was able to achieve an optimal solution value on the majority of instances where the optimal solution value is known. Also, for the majority of instances where optimization solvers found a solution value but were unable to prove it to be optimal, the VNS algorithm achieves an even better solution value.en
dc.publisherSlovak Academy of Sciences-
dc.relationOptimization of Distributive and Reverse Flows in Logistic Systems-
dc.relationMathematical Modelas and Optimization Methods on Large-Scale Systems-
dc.relation.ispartofComputing and Informaticsen
dc.subjectCombinatorial optimization | Metaheuristic | Roman domination in graphs | Variable neighborhood search | Weak Roman domination in graphsen
dc.titleVariable neighborhood search approach for solving Roman and weak Roman domination problems on graphsen
dc.typeArticleen
dc.identifier.doi10.31577/cai_2019_1_57en
dc.identifier.scopus2-s2.0-85072598780en
dc.relation.firstpage57en
dc.relation.lastpage84en
dc.relation.issue1en
dc.relation.volume38en
dc.description.rankM23-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0003-3607-6704-
crisitem.project.funderNSF-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php-
crisitem.project.fundingProgramDirectorate for Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/null/7360067-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103-
Show simple item record

SCOPUSTM   
Citations

1
checked on Jul 12, 2024

Page view(s)

66
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.