Author:
Zhou Lingyun,Ding Lixin,Qiang Xiaoli
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Aarts, E.H.L., Korst, J.H.M., van Laarhoven, P.J.M.: A Quantitative Analysis of The Simulated Annealing Algorithm: A Case Study For The Traveling Salesman Problem. Journal of Statistical Physics 50(1-2), 187–206 (1988)
2. Applegate, D.L.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
3. Chandra, B., Karloff, H., Tovey, C.: New Results on the Old K-Opt Algorithm for the Traveling Salesman Problem. SIAM Journal on Computing 28(6), 1998–2029 (1999)
4. Dorigo, M., Gambardella, L.M.: Ant Colonies for the Travelling Salesman Problem. Bio Systems 43(2), 73–81 (1997)
5. Adaptive and Intelligent Systems;G.K. Jati,2011
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献