Variable neighborhood search for the strong metric dimension problem
From MaRDI portal
Publication:2840752
DOI10.1016/J.ENDM.2012.10.008zbMATH Open1268.90156OpenAlexW2047871477MaRDI QIDQ2840752FDOQ2840752
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
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Variable neighborhood search
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- Variable neighbourhood search: methods and applications
- On Metric Generators of Graphs
- The strong metric dimension of graphs and digraphs
- Title not available (Why is that?)
- 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
Cited In (7)
- 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
- 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)
