A Graphical Algorithm for Solving an Investment Optimization Problem - Mines Saint-Étienne Access content directly
Conference Papers Year : 2013

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
Fichier principal
Vignette du fichier
pr-mi-13.pdf (224.53 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

emse-00851924 , version 1 (16-09-2013)

Identifiers

  • HAL Id : emse-00851924 , version 1

Cite

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⟩
252 View
204 Download

Share

Gmail Facebook X LinkedIn More