Author:
Turpin Matthew,Michael Nathan,Kumar Vijay
Publisher
Springer International Publishing
Reference17 articles.
1. Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. J. Algorithms 59(1), 1–18 (2006)
2. Armstrong, R.D., Jin, Z.: Solving linear bottleneck assignment problems via strong spanning trees. Oper. Res. Lett. 12(3), 179–180 (1992)
3. Burkard, R.E., Cela, E.: Linear Assignment Problems and Extensions. Springer, Berlin (1999)
4. Carlsson, J., Ge, D., Subramaniam, A., Wu, A., Ye, Y.: Solving min-max multi-depot vehicle routing problem. Lectures on Global Optimization. Fields Institute Communications, vol. 55, pp. 31-46 (2009)
5. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, DTIC Document (1976)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献