Variable neighborhood search for the strong metric dimension problem

DOI10.1016/j.endm.2012.10.008zbMath1268.90156OpenAlexW2047871477MaRDI QIDQ2840752

Mirjana Čangalović, Nenad Mladenović, Jozef Kratica, Vera V. Kovacevic-Vujcic

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2012.10.008

zbMATH Keywords

combinatorial optimizationmetaheuristicsstrong metric dimension

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (5)

Closed formulae for the strong metric dimension of lexicographic product graphs ⋮ A metaheuristic approach to the dominating tree problem ⋮ Strong resolving graphs: the realization and the characterization problems ⋮ On the geodesic identification of vertices in convex plane graphs ⋮ The simultaneous strong metric dimension of graph families

Cites Work

• Unnamed Item
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• The strong metric dimension of graphs and digraphs
• Variable neighbourhood search: methods and applications
• Variable neighborhood search
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Computing strong metric dimension of some special classes of graphs by genetic algorithms
• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
• On Metric Generators of Graphs

This page was built for publication: Variable neighborhood search for the strong metric dimension problem