Optimal Routing under Capacity and Distance Restrictions
暂无分享,去创建一个
[1] Ralph E. Gomory,et al. An algorithm for integer solutions to linear programs , 1958 .
[2] Paolo Toth,et al. Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations , 1981, Math. Program..
[3] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[4] Nicos Christofides,et al. The vehicle routing problem , 1976, Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle.
[5] Thomas L. Magnanti,et al. Implementing vehicle routing algorithms , 1977, Networks.
[6] Susan Powell,et al. Fortran codes for mathematical programming: linear, quadratic and discrete , 1973 .
[7] Gilbert Laporte,et al. A Cutting Planes Algorithm for the m-Salesmen Problem , 1980 .
[8] Samuel J. Raff,et al. Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..
[9] Gilbert Laporte,et al. Two exact algorithms for the distance-constrained vehicle routing problem , 1984, Networks.
[10] G. Laporte,et al. A branch and bound algorithm for the capacitated vehicle routing problem , 1983 .