Журнал «Современная Наука»

Russian (CIS)English (United Kingdom)
 MOSCOW +7(495)-142-86-81

Solution of dynamic programming problems by network methods

Chaadaev K. V.  (National Research University Bauman Moscow State Technical University)

The possibility of increasing the efficiency of the application of the dynamic programming method by transforming discrete optimization problems into network models is considered. The development of the corresponding algorithm and its software implementation in relation to the solution of multicriteria problems. The developed algorithm and the corresponding machine program can serve as a universal basis for constructing any algorithms and programs for solving discrete dynamic programming problems.

Keywords:algorithm, computational complexity, decomposition, discrete optimization, dynamic programming, exact methods, network model.

 

Read the full article …

Citation link:
Chaadaev K. V. Solution of dynamic programming problems by network methods // Современная наука: актуальные проблемы теории и практики. Серия: Естественные и Технические Науки. -2022. -№01/2. -С. 63-71 DOI 10.37882/2223-2966.2022.01-2.21
LEGAL INFORMATION:
Reproduction of materials is permitted only for non-commercial purposes with reference to the original publication. Protected by the laws of the Russian Federation. Any violations of the law are prosecuted.
© ООО "Научные технологии"

Terms Publications

Issues of the journals (Archive)

ECONOMICS AND LAW
HUMANITIES
NATURAL AND TECHNICAL SCIENCES
COGNITION

Серия - Natural and Technical Sciences