1. V. V.Korobkin, A. N. Sesekin, O. L. Tashlykov, and A.G. Chentsov, Routing Methods and Their Applications in Problems of the Enhancement of Safety and Efficiency of Nuclear Plant Operation (Novye Tekhnologii, Moscow, 2012) [in Russian].
2. A. G. Chentsov, “On routing of task complexes,” Vestn. Udmurt. Univ., Ser. Mat. Mekh. Komp. Nauki, No. 1, 59–82 (2013).
3. A. G. Chentsov, A. A. Chentsov, and P. A. Chentsov, “Elements of dynamic programming in extremal routing problems,” Problemy Upravl., No. 5, 12–21 (2013).
4. A. G. Chentsov, “Problem of successive megalopolis traversal with the precedence conditions,” Autom. Remote Control 75 (4), 728–744 (2014).
5. R. Karp, “Reducibility among combinatorial problems,” in Complexity of Computer Computations, Ed. by R. E. Miller and J. W. Thatcher (Plenum, New York, 1972), pp. 85–103.