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 metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01435294
Contributor : Alexandre Dolgui <>
Submitted on : Friday, January 13, 2017 - 5:13:09 PM
Last modification on : Thursday, October 17, 2019 - 12:36:12 PM
Long-term archiving on : Friday, April 14, 2017 - 7:43:29 PM

File

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

Identifiers

Citation

Evgeny Gafarov, Alexandre Dolgui, Alexander 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⟩

Share

Metrics

Record views

346

Files downloads

289