Publisher
Springer Berlin Heidelberg
Reference91 articles.
1. Aarts EHL, Korst J (1989) Boltzmann machines for traveling salesman problems. European Journal of Operational Research, 39, 79-95
2. Applegate D, Cook W, Rohe A (1999) Chained lin-kernighan for large traveling salesman problems. Technical Report 99887, Forschungsinstitut fr Diskrete Mathematik Universit, Bonn
3. Arora S (1998) Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. Journal of the ACM, 45(5), 753-782
4. Baraglia R, Hidalgo JI, Perego R (2001) A hybrid heuristic for the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 5(6), 613-622
5. Bentley JL (1992) Fast algorithms for geometric traveling salesman problems. ORSA Journal on Computing, 4, 387-411
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献