Login / Signup
An approximate method to compute a sparse graph for traveling salesman problem.
Yong Wang
Published in:
Expert Syst. Appl. (2015)
Keyphrases
</>
traveling salesman problem
combinatorial optimization
objective function
computational complexity
cost function
dynamic programming
similarity measure
reinforcement learning
simulated annealing
energy function
ant colony optimization
minimum spanning tree