Geodesic
To question of routing of works complexes
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 1 (2013), pp. 59-82

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

The complicated variant of the problem of sequential megalopolis circuit with constraints in the form of preceding conditions is considered. The additional constraints on the junction character for fragments of exterior permutations and interior works (with respect to megalopolis) are imposed upon. It is supposed that costs of exterior permutations and interior works depend on the task list explicitly. The procedure of the dynamic programming type and (on their base) algorithm on the functional level are constructed.
Mots-clés : route
Keywords: dynamic programming, preceding conditions. 
@article{VUU_2013_1_a6,
     author = {A. G. Chentsov},
     title = {To question of routing of works complexes},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {59--82},
     publisher = {mathdoc},
     number = {1},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2013_1_a6/}
}
TY  - JOUR
AU  - A. G. Chentsov
TI  - To question of routing of works complexes
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2013
SP  - 59
EP  - 82
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VUU_2013_1_a6/
LA  - ru
ID  - VUU_2013_1_a6
ER  - 
%0 Journal Article
%A A. G. Chentsov
%T To question of routing of works complexes
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2013
%P 59-82
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VUU_2013_1_a6/
%G ru
%F VUU_2013_1_a6
A. G. Chentsov. To question of routing of works complexes. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 1 (2013), pp. 59-82. http://geodesic.mathdoc.fr/item/VUU_2013_1_a6/