Keywords: path, precedence conditions.
@article{TIMM_2012_18_1_a24,
author = {A. A. Chentsov and A. G. Chentsov},
title = {On a routing problem with internal tasks},
journal = {Trudy Instituta matematiki i mehaniki},
pages = {298--317},
year = {2012},
volume = {18},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TIMM_2012_18_1_a24/}
}
A. A. Chentsov; A. G. Chentsov. On a routing problem with internal tasks. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 18 (2012) no. 1, pp. 298-317. http://geodesic.mathdoc.fr/item/TIMM_2012_18_1_a24/
[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] Sesekin A. N., Tashlykov O. L., Scheklein S. E., Kuklin M. Yu., Chentsov A. G., Kadnikov A. A., “Ispolzovanie metoda dinamicheskogo programmirovaniya dlya optimizatsii traektorii peremescheniya rabotnikov v radiatsionno opasnykh zonakh s tselyu minimizatsii oblucheniya”, Izv. vuzov. Yadernaya energetika, 2006, no. 2, 41–48
[5] Tashlykov O. L., Sesekin A. N., Chentsov A. G., Scheklein S. E., Balushkin F. A., Khomyakov A. P., “Voprosy matematicheskikh metodov modelirovaniya v reshenii problemy snizheniya obluchaemosti personala”, Voprosy radiatsionnoi bezopasnosti, 2009, no. 4, 47–57
[6] Tashlykov O. L., Sesekin A. N., Scheklein S. E., Chentsov A. G., “Razrabotka optimalnykh algoritmov vyvoda AES iz ekspluatatsii s ispolzovaniem metodov matematicheskogo modelirovaniya”, Izv. vuzov. Yadernaya energetika, 2009, no. 2, 115–120
[7] Bellman R., “Primenenie dinamicheskogo programmirovaniya k zadache o kommivoyazhere”, Kibernet. sb., 9, Mir, M., 1964, 219–228
[8] Kheld M., Karp R. M., “Primenenie dinamicheskogo programmirovaniya k zadacham uporyadocheniya”, Kibernet. sb., 9, Mir, M., 1964, 202–218
[9] Chentsov A. A., Chentsov A. G., Chentsov P. A., “Ekstremalnaya zadacha marshrutizatsii peremeschenii s ogranicheniyami i vnutrennimi poteryami”, Izv. vuzov. Matematika, 2010, no. 6, 64–81 | MR | Zbl
[10] Chentsov A. G., “Metod dinamicheskogo programmirovaniya v ekstremalnykh zadachakh marshrutizatsii s ogranicheniyami”, Izv. RAN. Teoriya i sistemy upravleniya, 2010, no. 3, 61–73 | MR
[11] Chentsov A. G., Ekstremalnye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii, NITs Regulyarnaya i khaoticheskaya dinamika, M.–Izhevsk, 2008, 238 pp.
[12] Chentsov A. A., Chentsov A. G., Chentsov P. A., “Ekstremalnaya zadacha marshrutizatsii s vnutrennimi poteryami”, Tr. In-ta matematiki i mekhaniki UrO RAN, 14, no. 3, 2008, 183–201
[13] Chentsov A. G., “Ob optimalnoi marshrutizatsii v usloviyakh ogranichenii”, Dokl. RAN, 423:3 (2008), 303–307 | MR | Zbl
[14] Kuratovskii K., Mostovskii A., Teoriya mnozhestv, Mir, M., 1970, 416 pp. | MR