Geodesic
Routing with an abstract function of travel cost aggregation
Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 16 (2010) no. 3, pp. 240-264
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

An extremal routing problem with a criterion corresponding to an abstract function of payoff aggregation at individual travel stages is considered.
Keywords: routing, dynamic programming method, precedence conditions. 
@article{TIMM_2010_16_3_a26,
     author = {A. N. Sesekin and A. A. Chentsov and A. G. Chentsov},
     title = {Routing with an abstract function of travel cost aggregation},
     journal = {Trudy Instituta matematiki i mehaniki},
     pages = {240--264},
     year = {2010},
     volume = {16},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TIMM_2010_16_3_a26/}
}
TY  - JOUR
AU  - A. N. Sesekin
AU  - A. A. Chentsov
AU  - A. G. Chentsov
TI  - Routing with an abstract function of travel cost aggregation
JO  - Trudy Instituta matematiki i mehaniki
PY  - 2010
SP  - 240
EP  - 264
VL  - 16
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/TIMM_2010_16_3_a26/
LA  - ru
ID  - TIMM_2010_16_3_a26
ER  - 
%0 Journal Article
%A A. N. Sesekin
%A A. A. Chentsov
%A A. G. Chentsov
%T Routing with an abstract function of travel cost aggregation
%J Trudy Instituta matematiki i mehaniki
%D 2010
%P 240-264
%V 16
%N 3
%U http://geodesic.mathdoc.fr/item/TIMM_2010_16_3_a26/
%G ru
%F TIMM_2010_16_3_a26
A. N. Sesekin; A. A. Chentsov; A. G. Chentsov. Routing with an abstract function of travel cost aggregation. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 16 (2010) no. 3, pp. 240-264. http://geodesic.mathdoc.fr/item/TIMM_2010_16_3_a26/

[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] Sergeev S. I., “Gibridnye sistemy upravleniya i dinamicheskaya zadacha kommivoyazhera”, Avtomatika i telemekhanika, 2008, no. 1, 45–54 | MR | Zbl

[5] Minu M., Matematicheskoe programmirovanie, Nauka, M., 1990, 487 pp. | MR

[6] Markelova E. Yu., Rolschikov V. E., Chentsov A. G., Zadacha marshrutizatsii konechnogo chisla perekhodov sistemy s abstraktnoi funktsiei agregirovaniya zatrat, Dep. v VINITI 25.05.98, No 1577-V98, Chelyab. gos. un-t

[7] Klaassen G., Kryazhimskii A. V., Tarasyev A. M., “Multiequilibrium game of timing and competition of gas pipeline projects”, J. Optim. Theory Appl., 120:1 (2004), 147–179 | DOI | MR | Zbl

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

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

[10] Tashlykov O. L., Sesekin A. N., Scheklein S. E., Balushkin F. A., Chentsov A. G., Khomyakov A. P., “Vozmozhnosti matematicheskikh metodov modelirovaniya v reshenii problemy snizheniya obluchaemosti personala”, Voprosy radiatsionnoi bezopasnosti, 2009, no. 4, 39–49

[11] Chentsov A. G., Ekstremalnye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii, NITs Regulyarnaya i khaoticheskaya dinamika, M.–Izhevsk, 2008, 240 pp.

[12] Chentsov A. A., Chentsov A. G., “Ekstremalnaya zadacha marshrutizatsii “na uzkie mesta” s ogranicheniyami v vide uslovii predshestvovaniya”, Tr. In-ta matematiki i mekhaniki UrO RAN, 14, no. 2, 2008, 129–142 | Zbl

[13] Sesekin A. N., Chentsov A. A., Chentsov A. G., “Obobschennaya zadacha kurera s funktsiei zatrat, zavisyaschei ot spiska zadanii”, Izv. RAN. TiSU, 2010, no. 2, 68–77 | MR

[14] Bellman R., “Primenenie dinamicheskogo programmirovaniya k zadache o kommivoyazhere”, Kibernet. sb., 9, 1964, 219–228

[15] Kheld M., “Primenenie dinamicheskogo programmirovaniya k zadacham uporyadochivaniya”, Kibernet. sb., 9, 1964, 202–218

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

[17] Chentsov A. G., Mnozhestva, sobytiya, veroyatnost (osnovnye struktury), UGTU–UPI, Ekaterinburg, 2006, 200 pp.

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