Geodesic
Dynamic programming in a nonstationary route problem
Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 39 (2012) no. 1, pp. 151-154.

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

The variant of the dynamic programming method (DPM) is constructed for solving the route problem about megalopolis visiting with the singularity in the form of nonstationarity of permutation and (interior) works. The preceding conditions are given. Additive variant of the input aggregation is investigated.
Mots-clés : route
Keywords: preceding condition, Bellman function. 
@article{IIMI_2012_39_1_a71,
     author = {A. G. Chentsov and P. A. Chentsov},
     title = {Dynamic programming in a nonstationary route problem},
     journal = {Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta},
     pages = {151--154},
     publisher = {mathdoc},
     volume = {39},
     number = {1},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IIMI_2012_39_1_a71/}
}
TY  - JOUR
AU  - A. G. Chentsov
AU  - P. A. Chentsov
TI  - Dynamic programming in a nonstationary route problem
JO  - Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
PY  - 2012
SP  - 151
EP  - 154
VL  - 39
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IIMI_2012_39_1_a71/
LA  - ru
ID  - IIMI_2012_39_1_a71
ER  - 
%0 Journal Article
%A A. G. Chentsov
%A P. A. Chentsov
%T Dynamic programming in a nonstationary route problem
%J Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta
%D 2012
%P 151-154
%V 39
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IIMI_2012_39_1_a71/
%G ru
%F IIMI_2012_39_1_a71
A. G. Chentsov; P. A. Chentsov. Dynamic programming in a nonstationary route problem. Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta, Tome 39 (2012) no. 1, pp. 151-154. http://geodesic.mathdoc.fr/item/IIMI_2012_39_1_a71/

[1] Kormen T., Leizerson Ch., Rivest R., Algoritmy: Postroenie i analiz, MTsNMO, 2002, 960. pp.

[2] Chentsov A.G., Ekstremalnye zadachi marshrutizatsii i raspredeleniya zadanii: voprosy teorii, RKhD, Moskva–Izhevsk, 2008, 238 pp.