Finding Critical Nodes in Networks Using Variable Neighborhood Search.
Iván Martín de San LázaroJesús Sánchez-OroAbraham DuartePublished in: ICVNS (2021)
Keyphrases
- variable neighborhood search
- network structure
- metaheuristic
- tabu search
- heuristic methods
- directed graph
- social networks
- vehicle routing problem
- edge weights
- routing problem
- graph structure
- shortest path
- minimum spanning tree
- benchmark instances
- traveling salesman problem
- complex networks
- path relinking
- peer to peer