Geodesic
Extreme problems of routing with restrictions
Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 37 (2006) no. 3, pp. 163-166.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{IIMI_2006_37_3_a74,
     author = {A. G. Chentsov},
     title = {Extreme problems of routing with restrictions},
     journal = {Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta},
     pages = {163--166},
     publisher = {mathdoc},
     volume = {37},
     number = {3},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIMI_2006_37_3_a74/}
}
TY  - JOUR
AU  - A. G. Chentsov
TI  - Extreme problems of routing with restrictions
JO  - Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
PY  - 2006
SP  - 163
EP  - 166
VL  - 37
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IIMI_2006_37_3_a74/
LA  - ru
ID  - IIMI_2006_37_3_a74
ER  - 
%0 Journal Article
%A A. G. Chentsov
%T Extreme problems of routing with restrictions
%J Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
%D 2006
%P 163-166
%V 37
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IIMI_2006_37_3_a74/
%G ru
%F IIMI_2006_37_3_a74
A. G. Chentsov. Extreme problems of routing with restrictions. Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 37 (2006) no. 3, pp. 163-166. http://geodesic.mathdoc.fr/item/IIMI_2006_37_3_a74/

[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