1. Siharulidze, G.G., On one generalization of the traveling salesman problem. I, Avtom. Telemekh., 1971, no. 8, pp. 116–123.
2. Siharulidze, G.G., On one generalization of the traveling salesman problem. II, Avtom. Telemekh., 1971, no. 10, pp. 142–147.
3. Picard, J.C. and Queyranne, M., The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling, Oper. Res., 1978, vol. 26, no. 1, pp. 86–110.
4. Helvig, C.S., Robins, G., and Zelikovsky, A., The moving-target traveling salesman problem, J. Algorithm. Comput. Technol., 2003, vol. 49, no. 1, pp. 153–174.
5. Garey, M.R. and Johnson, D.S., Computers and intractability: A guide to the theory of NP-completeness, 1979, San Francisco, California: W. H. Freeman & Co.