1. Chalasani, P., & Motwani, R. (1999). Approximating capacitated routing and delivery problems. SIAM Journal on Computing, 28(6), 2133–2149.
2. Hammar, M., & Nilsson, B.J. (1999). Approximation results for kinetic variants of tsp. In International colloquium on automata, languages, and programming (pp. 392–401). Berlin:Springer.
3. Helvig, C. S., Robins, G., & Zelikovsky, A. (2003). The moving-target traveling salesman problem. Journal of Algorithms, 49(1), 153–174.
4. Jiang, Q., Sarker, R., & Abbass, H. (2005). Tracking moving targets and the non-stationary traveling salesman problem. Complexity International, 11(2005), 171–179.
5. Karuno, Y., Nagamochi, H., & Ibaraki, T. (1997). Vehicle scheduling on a tree with release and handling times. Annals of Operations Research, 69, 193–207.