@article{TIMM_2007_13_3_a10,
author = {A. A. Chentsov and A. G. Chentsov},
title = {{\CYRO}~{\cyrr}{\cyre}{\cyra}{\cyrl}{\cyri}{\cyrz}{\cyra}{\cyrc}{\cyri}{\cyri} {\cyrm}{\cyre}{\cyrt}{\cyro}{\cyrd}{\cyra} {\cyrd}{\cyri}{\cyrn}{\cyra}{\cyrm}{\cyri}{\cyrch}{\cyre}{\cyrs}{\cyrk}{\cyro}{\cyrg}{\cyro} {\cyrp}{\cyrr}{\cyro}{\cyrg}{\cyrr}{\cyra}{\cyrm}{\cyrm}{\cyri}{\cyrr}{\cyro}{\cyrv}{\cyra}{\cyrn}{\cyri}{\cyrya} {\cyrv}~{\cyro}{\cyrb}{\cyro}{\cyrb}{\cyrshch}{\cyre}{\cyrn}{\cyrn}{\cyro}{\cyrishrt} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch}{\cyre} {\cyrk}{\cyru}{\cyrr}{\cyrsftsn}{\cyre}{\cyrr}{\cyra}},
journal = {Trudy Instituta matematiki i mehaniki},
pages = {136--160},
year = {2007},
volume = {13},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TIMM_2007_13_3_a10/}
}
TY - JOUR AU - A. A. Chentsov AU - A. G. Chentsov TI - О реализации метода динамического программирования в обобщенной задаче курьера JO - Trudy Instituta matematiki i mehaniki PY - 2007 SP - 136 EP - 160 VL - 13 IS - 3 UR - http://geodesic.mathdoc.fr/item/TIMM_2007_13_3_a10/ LA - ru ID - TIMM_2007_13_3_a10 ER -
A. A. Chentsov; A. G. Chentsov. О реализации метода динамического программирования в обобщенной задаче курьера. Trudy Instituta matematiki i mehaniki, Trudy Instituta Matematiki i Mekhaniki UrO RAN, Tome 13 (2007) no. 3, pp. 136-160. http://geodesic.mathdoc.fr/item/TIMM_2007_13_3_a10/
[1] Melamed I. I., Sergeev S. I., Sigal I. Kh., “Zadacha kommivoyazhera. Voprosy teorii”, Avtomatika i telemekhanika, 1989, no. 9, 3–34 | MR
[2] Kuratovskii K., Mostovskii A., Teoriya mnozhestv, Mir, M., 1970, 416 pp. | MR
[3] Chentsov A. A., Chentsov A. G., Chentsov P. A., “Ob odnom obobschenii zadachi kurera”, Algoritmy i programmnye sredstva parallelnykh vychislenii, 8, UrO RAN, Ekaterinburg, 2004, 178–235
[4] Chentsov A. A., Chentsov A. G., Chentsov P. A., “Obobschennaya versiya zadachi kurera”, Sb. nauch. tr., Matematicheskii i prikladnoi analiz, 2, Tyumenskii gos. un-t, Tyumen, 2005, 238–280
[5] Chentsov A. G., Chentsov P. A., “Metod dinamicheskogo programmirovaniya v nekotorykh versiyakh zadachi kommivoyazhera s ogranicheniyami”, Algoritmy i programmnye sredstva parallelnykh vychislenii, 7, UrO RAN, Ekaterinburg, 2003, 217–234
[6] Chentsov A. G., Chentsov P. A., “Marshrutizatsiya s usloviyami predshestvovaniya (zadacha kurera): metod dinamicheskogo programmirovaniya”, Vestnik UGTU-UPI, 2004, no. 15(45), 148–151
[7] 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
[8] Chentsov A. G., “Ekstremalnye zadachi marshrutizatsii s ogranicheniyami”, Izv. Udmurtskogo gos. un-ta, 2006, no. 3, 163–166