Author:
Yu Wei,Golin Mordecai,Zhang Guochuan
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference26 articles.
1. An, H.-C., Kleinberg, R., & Shmoys, D. B. (2015). Improving Christofides’ algorithm for the s-t Path TSP. Journal of the ACM, 62(5), Article 34.
2. Augustine, J. E., & Seiden, S. (2004). Linear time approximation schemes for vehicle scheduling problems. Theoretical Computer Science, 324, 147–160.
3. Bao, X., & Liu, Z. (2012). Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle. Theoretical Computer Science, 434, 1–10.
4. Bhattacharya, B., Carmi, P., Hu, Y., & Shi, Q. (2008). Single vehicle scheduling problems on path/tree/cycle networks with release and handling times. In Proceedings of the 19th international symposium on algorithms and computation (ISAAC) (pp. 800–811).
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