论文信息 - TSP - A R-Package for the Traveling Salesperson Problem - 字舞流文

TSP - A R-Package for the Traveling Salesperson Problem

Kurt Hornik | Michael Hahsler | Michael Hahsler | K. Hornik

[1] Weixiong Zhang,et al. Rearrangement Clustering: Pitfalls, Remedies, and Applications , 2006, J. Mach. Learn. Res..

[2] Gregory Gutin,et al. The traveling salesman problem , 2006, Discret. Optim..

[3] William J. Cook,et al. TSP Cuts Which Do Not Conform to the Template Paradigm , 2000, Computational Combinatorial Optimization.

[4] Daniel J. Rosenkrantz,et al. An Analysis of Several Heuristics for the Traveling Salesman Problem , 1977, SIAM J. Comput..

[5] Jan Karel Lenstra,et al. Some Simple Applications of the Travelling Salesman Problem , 1975 .

[6] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[7] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .

[8] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[9] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .