A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.
Jorik JookenPieter LeymanPatrick De CausmaeckerPublished in: J. Heuristics (2020)
Keyphrases
- multi start
- undirected graph
- search algorithm
- tabu search
- global optimization
- directed graph
- stochastic approximation
- path relinking
- vehicle routing problem with time windows
- approximation algorithms
- directed acyclic graph
- search procedure
- metaheuristic
- search space
- connected components
- branch and bound
- graph structure
- heuristic search
- complex networks
- spanning tree
- scatter search
- minimum cost
- vehicle routing problem
- vertex set
- genetic algorithm
- max sat
- np complete
- hill climbing
- least squares
- np hard
- special case