Author:
Pérez-Escalona Pedro,Rapaport Ivan,Soto José,Vidal Ian
Publisher
Springer International Publishing
Reference16 articles.
1. Bao, X., Liu, Z.: Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theor. Comput. Sci. 434, 1–10 (2012)
2. Amariah, B., Alice, P.: A framework for vehicle routing approximation schemes in trees. In: Workshop on Algorithms and Data Structures, pp. 112–125. Springer (2019)
3. Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3), 209–219 (2006)
4. Nicos, C.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report, Carnegie-Mellon University Pittsburgh Pa Management Sciences Research Group (1976)
5. Greg, N.F., Matthew, S.H., Chul, E.K.: Approximation algorithms for some routing problems. SIAM J. Comput. 7(2), 178–193 (1978)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献