A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs.
Jorik JookenPieter LeymanPatrick De CausmaeckerPublished in: CoRR (2019)
Keyphrases
- multi start
- undirected graph
- search algorithm
- tabu search
- global optimization
- path relinking
- directed graph
- approximation algorithms
- stochastic approximation
- spanning tree
- vehicle routing problem with time windows
- minimum cost
- complex networks
- directed acyclic graph
- search space
- search procedure
- metaheuristic
- connected components
- heuristic search
- branch and bound
- graph structure
- hill climbing
- vertex set
- simulated annealing
- max sat
- scheduling problem
- vehicle routing problem
- evolutionary algorithm
- social networks
- np hard