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

Yong Wang Jeffrey B. Remmel

Published in: CoRR (2018)

Keyphrases

traveling salesman problem
combinatorial optimization
objective function
cost function
computational complexity
dynamic programming
neural network
lower bound
similarity search
similarity function
graph matching
combinatorial optimization problems