[1] Chentsov A. G., Chentsov P. A., “Metod dinamicheskogo programmirovaniya v nekotorykh versiyakh zadachi kommivoyazhera s ogranicheniyami”, Algoritmy i program. sredstva parallel. vychislenii, 7, UrO RAN, Ekaterinburg, 2003, 217–242

[2] Chentsov A. G., Chentsov P. A., “Marshrutizatsiya s usloviyami predshestvovaniya (zadacha kurera): metod dinamicheskogo programmirovaniya”, Na peredovykh rubezhakh nauki i inzhenernogo tvorchestva, v. 1, Vestnik UGTU–UPI, 15(45), GUO VPO UGTU-UPI, Ekaterinburg, 2004, 148–152

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

[4] Chentsov A. G., “Ekstremalnye zadachi marshrutizatsii”, Modernizatsiya obrazovaniya v usloviyakh globalizatsii, Trudy konferentsii (kruglyi stol «Obrazovanie cherez nauku i innovatsii»), Izd-vo Tyumenskogo un-ta, Tyumen, 2005, 106–110

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

[6] Chentsov A. A., Chentsov A. G., “Reduktsiya zadach marshrutnoi optimizatsii”, Avtomatika i telemekhanika, 2000, no. 10, 136–150 | MR | Zbl

[7] 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

[8] Chentsov A. A., Chentsov A. G., Chentsov P. A., “Obobschennaya versiya zadachi kurera”, Prikladnoi i matematicheskii analiz, 2, Izd-vo Tyumenskogo un-ta, Tyumen, 2005, 238–280

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