A fundamental problem in vehicle routing
暂无分享,去创建一个
[1] Claude Berge,et al. The Theory Of Graphs , 1962 .
[2] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[3] Katta G. Murty,et al. Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..
[4] T. C. Hu. A Decomposition Algorithm for Shortest Paths in a Network , 1968, Oper. Res..
[5] George L. Nemhauser,et al. The Traveling Salesman Problem: A Survey , 1968, Oper. Res..
[6] S. Vajda,et al. Integer Programming and Network Flows , 1970 .
[7] Mandell Bellmore,et al. Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..
[8] Jack Edmonds,et al. Matching, Euler tours and the Chinese postman , 1973, Math. Program..
[9] Brian W. Kernighan,et al. An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..