DC FieldValueLanguage
dc.contributor.authorMladenović, Nenaden
dc.contributor.authorKratica, Jozefen
dc.contributor.authorKovačević-Vujčić, Veraen
dc.contributor.authorČangalović, Mirjanaen
dc.date.accessioned2020-04-26T19:14:53Z-
dc.date.available2020-04-26T19:14:53Z-
dc.date.issued2012-07-16en
dc.identifier.issn0377-2217en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/488-
dc.description.abstractIn this paper, two similar NP-hard optimization problems on graphs are considered: the metric dimension problem and the problem of determining a doubly resolving set with the minimum cardinality. Both are present in many diverse areas, including network discovery and verification, robot navigation, and chemistry. For each problem, a new mathematical programming formulation is proposed. For solving more realistic large-size instances, a variable neighborhood search based heuristic is designed. An extensive experimental comparison on five different types of instances indicates that the VNS approach consistently outperforms a genetic algorithm, the only existing heuristic in the literature designed for solving those problems.en
dc.publisherElsevier-
dc.relationMathematical Modelas and Optimization Methods on Large-Scale Systems-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofEuropean Journal of Operational Researchen
dc.subjectCombinatorial optimization | Metaheuristics | Metric dimension | Minimal doubly resolving set | Variable neighborhood searchen
dc.titleVariable neighborhood search for metric dimension and minimal doubly resolving set problemsen
dc.typeArticleen
dc.identifier.doi10.1016/j.ejor.2012.02.019en
dc.identifier.scopus2-s2.0-84859801092en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage328en
dc.relation.lastpage337en
dc.relation.issue2en
dc.relation.volume220en
dc.description.rankM21a-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.author.orcid0000-0002-9752-0971-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Engineering-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
Show simple item record

SCOPUSTM   
Citations

26
checked on Jun 20, 2024

Page view(s)

85
checked on May 10, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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