Variable neighborhood search for the strong metric dimension problem

DOI10.1016/J.ENDM.2012.10.008MaRDI QIDQ2840752zbMATH OpenOpenAlexFDO

Authors Nenad Mladenović, Jozef Kratica, Mirjana Čangalović, Vera Kovačević-Vujčić

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)

Recommendations

• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Variable neighborhood search
• Variable Neighborhood Search
• Variable neighborhood search: Principles and applications
• Developments of variable neighborhood search

Cites work

• 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
• Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
• On Metric Generators of Graphs
• The strong dimension of distance-hereditary graphs
• The strong metric dimension of graphs and digraphs
• Variable neighborhood search
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Variable neighbourhood search: methods and applications

Cited in

(8)

• On the geodesic identification of vertices in convex plane graphs
• Variable Neighborhood Search Approach for Solving Roman and Weak Roman Domination Problems on Graphs
• Strong resolving graphs: the realization and the characterization problems
• The simultaneous strong metric dimension of graph families
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Closed formulae for the strong metric dimension of lexicographic product graphs
• Arbitrary-norm hyperplane separation by variable neighbourhood search
• A metaheuristic approach to the dominating tree problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840752)