RUS  ENG
Full version
JOURNALS // Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki // Archive

Zh. Vychisl. Mat. Mat. Fiz., 1983 Volume 23, Number 1, Pages 223–227 (Mi zvmmf5626)

Scientific communications

Numerical methods for a class of problems of optimal flow control on graphs

N. S. Vasil'ev

Moscow

Abstract: 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.

UDC: 519.6:517.977

MSC: Primary 90B10; Secondary 90C10, 65K05, 90C35

Received: 19.02.1981
Revised: 04.01.1982


 English version:
USSR Computational Mathematics and Mathematical Physics, 1983, 23:1, 160–163

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025