Skip to Main content Skip to Navigation
Journal articles

A new effective dynamic program for an investment optimization problem

Abstract : After a series of publications of T.E. O'Neil et al. (e.g. in 2010), dynamic programming seems to be the most promising way to solve knapsack problems. Some techniques are known to make dynamic programming algorithms (DPA) faster. One of them is the graphical method that deals with piecewise linear Bellman functions. For some problems, it was previously shown that the graph-ical algorithm has a smaller running time in comparison with the classical DPA and also some other advantages. In this paper, an exact graphical algorithm (GrA) and a fully polynomial-time approximation scheme based on it are presented for an investment optimization problem having the best known running time. The algorithms are based on new Bellman functional equations and a new way of implementing the GrA.
Complete list of metadata

Cited literature [29 references]  Display  Hide  Download
Contributor : Alexandre Dolgui Connect in order to contact the contributor
Submitted on : Friday, January 13, 2017 - 5:13:09 PM
Last modification on : Tuesday, May 31, 2022 - 3:10:34 AM
Long-term archiving on: : Friday, April 14, 2017 - 7:43:29 PM


AaRC_GDLW2015 Web.pdf
Files produced by the author(s)



Evgeny A Gafarov, Alexandre Dolgui, Alexander A Lazarev, Frank Werner. A new effective dynamic program for an investment optimization problem. Automation and Remote Control / Avtomatika i Telemekhanika, MAIK Nauka/Interperiodica, 2016, 77 (9), pp.1633-1648. ⟨10.1134/S0005117916090101⟩. ⟨hal-01435294⟩



Record views


Files downloads