Funder
the National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference25 articles.
1. Arkin EM, Hassin R, Levin A (2006) Approximations for minimum and min–max vehicle routing problems. J Algorithms 59:1–18
2. Arora S, Grigni M, Karger DR, Klein P, Woloszyn A (1998) A polynomial-time approximation scheme for weighted planar graph TSP. In: The proceedings of the 9th annual ACM–SIAM symposium on discrete algorithms, pp 33–41
3. Bhattacharya B, Hu Y (2010) Approximation algorithms for the multi-vehicle scheduling problem. In: Cheong O, Chwa K-Y, Park K (eds) The proceedings of the 21th international symposium on algorithms and computation. Lecture notes in computer science, vol 6507. Springer, Heidelberg, pp 192–205
4. Campbell AM, Vandenbussche D, Hermann W (2008) Routing for relief efforts. Transp Sci 42:127–145
5. Christofides N (1976) Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, Graduate School of Industrial Administration. Carnegie-Mellon University, Pittsburgh, PA
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献