Numerical methods for a class of problems of optimal flow control on graphs
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 1, pp. 223-227
Voir la notice de l'article provenant de la source Math-Net.Ru
A class of problems dealing with optimal flow control in the analysis of mathematical models of communication networks is discussed. The control problem consists of the optimal choice of the paths on a given graph and, for fixed paths, in solving a discrete optimal-control problem. A scheme for reduced recurrent inspection of the paths (full inspection may be impossible because of the large volume of the problem) is substantiated, and the convergence of the proposed algorithms is proved.
@article{ZVMMF_1983_23_1_a29,
author = {N. S. Vasil'ev},
title = {Numerical methods for a class of problems of optimal flow control on graphs},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {223--227},
publisher = {mathdoc},
volume = {23},
number = {1},
year = {1983},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_1_a29/}
}
TY - JOUR AU - N. S. Vasil'ev TI - Numerical methods for a class of problems of optimal flow control on graphs JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1983 SP - 223 EP - 227 VL - 23 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_1_a29/ LA - ru ID - ZVMMF_1983_23_1_a29 ER -
%0 Journal Article %A N. S. Vasil'ev %T Numerical methods for a class of problems of optimal flow control on graphs %J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki %D 1983 %P 223-227 %V 23 %N 1 %I mathdoc %U http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_1_a29/ %G ru %F ZVMMF_1983_23_1_a29
N. S. Vasil'ev. Numerical methods for a class of problems of optimal flow control on graphs. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 1, pp. 223-227. http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_1_a29/