Funder
National Natural Science Foundation of China
Natural Science Foundation of Shanghai
East China University of Science and Technology
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference17 articles.
1. Arkin EM, Hassin R, Levin A (2006) Approximations for minimum and min-max vehicle routing problems. J Algorithms 59:1–18
2. Assad AA (1988) Modeling and implementation issues in vehicle routing. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies. North Holland, Amsterdam, pp 7–45
3. Chen Q, Huang X, Ran Y (2018) Approximation algorithm for distance constraint sweep coverage without predetermined base stations. Discrete Math Algorithms Appl 10(5):1850064
4. Frederickson GN, Hecht MS, Kim CE (1978) Approximation algorithms for some routing problems. SIAM J Comput 7(2):178–193
5. Friggstad Z, Swamy C (2014) Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing. In: The proceedings of the 46th annual ACM symposium on theory of computing, pp 744–753
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献