Funder
National Natural Science Foundation of China
National Natural Science Foundation of China/ Research Grants Council of Hong Kong
Subject
Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering
Reference70 articles.
1. An improved branch-and-cut algorithm for the capacitated vehicle routing problem;Achuthan;Transportation Science,2003
2. The capacity and distance constrained plant location problem;Albareda-Sambola;Computers and Operations Research,2009
3. Augerat, P., Belenger, J., Benavent, E., Corberan, A., Naddef, D., Rinaldi, G., 1995. Computational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem. Technical Report: RR 949-M.
4. An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles;Azi;European Journal of Operational Research,2010
5. An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts;Baldacci;Mathematical Programming,2008
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献