DC FieldValueLanguage
dc.contributor.authorKratica, Jozefen
dc.contributor.authorKovacevic-Vujčić, Veraen
dc.contributor.authorČangalović, Mirjanaen
dc.date.accessioned2020-04-26T19:14:55Z-
dc.date.available2020-04-26T19:14:55Z-
dc.date.issued2008-01-01en
dc.identifier.issn0354-0243en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/503-
dc.description.abstractIn this paper we consider the NP-hard problem of determining the strong metric dimension of graphs. The problem is solved by a genetic algorithm that uses binary encoding and standard genetic operators adapted to the problem. This represents the first attempt to solve this problem heuristically. We report experimental results for the two special classes of ORLIB test instances: crew scheduling and graph coloring.en
dc.relationFaculty of Organizational Sciences, University of Belgrade-
dc.relationSerbian Ministry of Science, Grant no. 144015G-
dc.relation.ispartofYugoslav Journal of Operations Researchen
dc.subjectEvolutionary approach | Genetic algorithms | Strong metric dimensionen
dc.titleComputing strong metric dimension of some special classes of graphs by genetic algorithmsen
dc.typeArticleen
dc.identifier.doi10.2298/YJOR0802143Ken
dc.identifier.scopus2-s2.0-57749195570en
dc.relation.firstpage143en
dc.relation.lastpage151en
dc.relation.issue2en
dc.relation.volume18en
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.fulltextNo Fulltext-
item.grantfulltextnone-
crisitem.author.orcid0000-0002-9752-0971-
Show simple item record

SCOPUSTM   
Citations

24
checked on Nov 22, 2024

Page view(s)

17
checked on Nov 23, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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