Login / Signup
A note on exploiting the Hamiltonian cycle problem substructure of the Asymmetric Traveling Salesman Problem.
Joseph F. Pekny
Donald L. Miller
Daniel Stodolsky
Published in:
Oper. Res. Lett. (1991)
Keyphrases
</>
hamiltonian cycle
traveling salesman problem
phase transition
combinatorial optimization problems
graph coloring
branch and bound algorithm
dynamic programming
objective function
evolutionary algorithm
special case
combinatorial problems
long run