A Method to Compute the Sparse Graphs for Traveling Salesman Problem Based on Frequency Quadrilaterals.

Yong Wang Jeffrey B. Remmel

Published in: FAW (2018)

Keyphrases

traveling salesman problem
combinatorial optimization
dynamic programming
similarity measure
reinforcement learning
objective function
search algorithm
computational complexity
evolutionary algorithm
cost function
scheduling problem
minimum spanning tree