Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of Cities
暂无分享,去创建一个
[1] T. J. Gaskell,et al. Bases for Vehicle Fleet Scheduling , 1967 .
[2] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[3] Nicos Christofides,et al. An Algorithm for the Vehicle-dispatching Problem , 1969 .
[4] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .
[5] G. Croes. A Method for Solving Traveling-Salesman Problems , 1958 .
[6] H. G. M. Pullen,et al. A computer application to a transport scheduling problem , 1967, Comput. J..
[7] Albert Battersby,et al. Advances in Critical Path Methods , 1966 .
[8] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..