A Graphical Algorithm for Solving an Investment Optimization Problem

Abstract : In this paper, a graphical algorithm (GrA) is presented for an investment optimization problem. This algorithm is based on the same Bellman equations as the best known dynamic programming algorithm (DPA) for the problem but the GrA has several advantages in comparison with the DPA. Based on this GrA, a fully-polynomial time approximation scheme is proposed having the best known running time. The idea of the GrA presented can also be used to solve some similar scheduling or lot-sizing problems in a more e ffective way
Document type :
Conference papers
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal-emse.ccsd.cnrs.fr/emse-00851924
Contributor : Florent Breuil <>
Submitted on : Monday, September 16, 2013 - 1:16:06 PM
Last modification on : Thursday, October 17, 2019 - 12:36:12 PM
Long-term archiving on : Wednesday, April 5, 2017 - 8:52:17 PM

File

pr-mi-13.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : emse-00851924, version 1

Citation

Evgeny R. Gafarov, Alexandre Dolgui, Alexander Lazarev, Frank Werner. A Graphical Algorithm for Solving an Investment Optimization Problem. Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2013), Aug 2013, Ghent, Belgium. 27p. ⟨emse-00851924⟩

Share

Metrics

Record views

567

Files downloads

363