An Optimal XP Algorithm for Hamiltonian Cycle on Graphs of Bounded Clique-Width.

Benjamin Bergougnoux Mamadou Moustapha Kanté O-joung Kwon

Published in: WADS (2017)

Keyphrases

hamiltonian cycle
dynamic programming
optimal solution
objective function
simulated annealing
traveling salesman problem
computational complexity
np hard
optimization algorithm
ant colony optimization
learning algorithm
search space
upper bound
branch and bound
swarm intelligence
bin packing