Variable neighborhood search for the strong metric dimension problem.
Nenad MladenovicJozef KraticaVera Kovacevic-VujcicMirjana CangalovicPublished in: Electron. Notes Discret. Math. (2012)
Keyphrases
- variable neighborhood search
- metaheuristic
- tabu search
- heuristic methods
- traveling salesman problem
- minimum spanning tree
- hybrid method
- vehicle routing problem
- routing problem
- single machine scheduling problem
- benchmark instances
- search procedure
- path relinking
- simulated annealing
- search space
- lower bound
- social network analysis
- max min
- worst case