On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem.

Edward Kh. Gimadi Oxana Yu. Tsidulko

Published in: AIST (2018)

Keyphrases

traveling salesman problem
dynamic programming
combinatorial optimization
asymptotically optimal
hamiltonian cycle
ant colony optimization
objective function
optimal solution
computational complexity
search space
cost function
worst case
learning algorithm
similarity measure
linear programming
traveling salesman