Funder
National Natural Science Foundation of China
Natural Science Foundation of Shanghai
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference23 articles.
1. Arkin EM, Hassin R, Levin A (2006) Approximations for minimum and min–max vehicle routing problems. J Algorithms 59:1–18
2. Atallah MJ, Kosaraju SR (1988) Efficent solutions to some transportation problems with applications to minimizing robot arm travel. SIAM J Comput 17(5):849–869
3. Bao X, Lu C, Huang D, Yu W (2021) Approximation algorithm for min–max cycle cover problem on a mixed graph. Oper Res Trans 25(1):107–113 (in Chinese)
4. Berbeglia G, Cordeau JF, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. TOP 15:1–31
5. Calvo RW, Colorni A (2007) An effective and fast heuristic for the Dial-a-Ride problem. 4OR 5(1):61–73
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献