[1] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Zadacha kommivoyazhera. Voprosy teorii”, Avtomatika i telemekhanika, 1989, no. 9, 3–34 | MR

[2] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Zadacha kommivoyazhera. Tochnye algoritmy”, Avtomatika i telemekhanika, 1989, no. 10, 3–29 | MR | Zbl

[3] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Zadacha kommivoyazhera. Priblizhennye algoritmy”, Avtomatika i telemekhanika, 1989, no. 11, 3–26 | MR | Zbl

[4] Henry-Labordere A. L., “The record-balancing problem: a dynamic programming solution of a generalized traveling salesman problem”, R.I.R.O., 3:2 (1969), 43–49 | Zbl

[5] Laporte G., Nobert Y., “Generalized traveling salesman problem through $n$ sets of nodes: an integer programming approach”, INFOR, 21:1 (1983), 61–75 | MR | Zbl

[6] Leiten A. K., “Nekotorye modifikatsii zadachi kommivoyazhera”, Tr. VTs Tart. un-ta, 28, 1973, 44–58 | MR

[7] Korotaeva L. N., Sesekin A. N., Chentsov A. G., “Ob odnoi modifikatsii metoda dinamicheskogo programmirovaniya v zadache posledovatelnogo sblizheniya”, Zhurn. vychisl. matematiki i mat. fiziki, 29:8 (1989), 1107–1113 | MR | Zbl

[8] Korotaeva L. N., Nazarov E. M., Chentsov A. G., “Ob odnoi zadache o naznacheniyakh”, Zhurn. vychisl. matematiki i mat. fiziki, 33:4 (1993), 483–494 | MR | Zbl

[9] Chentsov A. A., Chentsov A. G., “O reshenii zadachi marshrutnoi optimizatsii metodom dinamicheskogo programmirovaniya”, Avtomatika i telemekhanika, 1998, no. 9, 117–129 | MR | Zbl

[10] Chentsov A. A., Chentsov A. G., “K voprosu o reshenii zadachi posledovatelnogo obkhoda mnozhestv s ispolzovaniem “nezamknutoi” zadachi kommivoyazhera”, Avtomatika i telemekhanika, 2002, no. 11, 151–166 | MR | Zbl

[11] Chentsov A. A., Chentsov A. G., “Dynamic programming method in the generalized traveling salesman problem: The influence of inexact calculations”, Math. Comput. Modelling, 33 (2001), 801–819 | DOI | MR | Zbl

[12] Chentsov A. G., Chentsov P. A., “Marshrutizatsiya s usloviyami predshestvovaniya (zadacha kurera): metod dinamicheskogo programmirovaniya”, Vestn. UGTU-UPI, 2004, no. 15, 148–151

[13] Chentsov A. A., Chentsov A. G., Chentsov P. A., “Ob odnom obobschenii zadachi kurera”, Algoritmy i program. sredstva paral. vychislenii, 8, UrO RAN, Ekaterinburg, 2004, 178–235

[14] Chentsov A. A., Chentsov A. G., Chentsov P. A., “Obobschennaya versiya zadachi kurera”, Matematicheskii i prikladnoi analiz, sb. nauch. tr. Vyp. 2, Izd-vo Tyumen. gos. un-ta, Tyumen, 2005, 238–280

[15] Chentsov A. G., “O strukture odnoi ekstremalnoi zadachi marshrutizatsii s ogranicheniyami v vide uslovii predshestvovaniya”, Vestn. Udmurt. un-ta. Matematika, 2006, no. 1, 127–150

[16] Chentsov A. G., “Ekstremalnye zadachi marshrutizatsii s ogranicheniyami”, Izv. In-ta matematiki i informatiki, 2006, no. 3, 163–166, Udmurt. gos. un-t

[17] Plotinskii Yu. M., “Obschaya zadacha razvozki”, Avtomatika i telemekhanika, 1973, no. 6, 100–104 | Zbl

[18] Melamed I. I., Plotinskii Yu. M., “Evristicheskii algoritm resheniya obobschennoi zadachi razvozki”, Avtomatika i telemekhanika, 1979, no. 12, 167–172 | Zbl

[19] Kuratovskii K., Mostovskii A., Teoriya mnozhestv, Mir, M., 1970, 416 pp. | MR

[20] Chentsov A. A., Chentsov A. G., “O realizatsii metoda dinamicheskogo programmirovaniya v obobschennoi zadache kurera”, Tr. In-ta matematiki i mekhaniki UrO RAN, 13, no. 3, 2007, 136–160