An O(n² log n) Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs.

Wei-Kuan Shih T. C. Chern Wen-Lian Hsu

Published in: SIAM J. Comput. (1992)

Keyphrases

hamiltonian cycle
objective function
learning algorithm
cost function
dynamic programming
computational complexity
search space
np hard
linear programming
particle swarm optimization
traveling salesman problem
optimal solution
branch and bound algorithm