Abstract
Consideration was given to a graphic realization of the method of dynamic programming. Its concept was demonstrated by the examples of the partition and knapsack problems. The proposed method was compared with the existing algorithms to solve these problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Papadimitrou, Ch. and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity, Engle-wood Cliffs: Prentice Hall, 1982. Translated under the title Kombinatornaya optimizatsiya: algoritmy i slozhnost’, Moscow: Mir, 1985.
Keller, H., Pferschy, U., and Pisinger, D., Knapsack Problems, New York: Springer, 2004.
Bellman, R., Dynamic Programming, Princeton: Princeton Univ. Press, 1957. Translated under the title Dinamicheskoe programmirovanie, Moscow: Inostrannaya Literatura, 1960.
Sigal, I.Kh. and Ivanova, A.P., Vvedenie v prikladnoe diskretnoe programmirovanie (Introduction to Applied Discrete Programming), Moscow: Fizmatlit, 2002.
Moiseev, N.N., Ed., Sovremennoe sostoyanie teorii issledovaniya operatsii (State-of-the-Art of the Operation Research Theory), Moscow: Nauka, 1979.
Author information
Authors and Affiliations
Additional information
Original Russian Text © A.A. Lazarev, 2007, published in Avtomatika i Telemekhanika, 2007, No. 4, pp. 13–23.
The work was executed within the framework of the scientific school of Acad. Yu.I. Zhuravlev, NSh-5833.2006.1.