Reducing the Memory Requirements of Dynamic Programming

Peter J. Wong and David G. Luenberger
Additional contact information
Peter J. Wong: Stanford University, Stanford, and Stanford Research Institute, Menlo Park, California
David G. Luenberger: Stanford University, Stanford, and Stanford Research Institute, Menlo Park, California

Operations Research, 1968, vol. 16, issue 6, 1115-1125

Abstract: This paper presents a decomposition procedure for extending the size of problems that can be solved using dynamic programming. It essentially consists of decomposing the tabular arrays of data into blocks of data, and then performing the dynamic programming calculations over the whole tabular array by calculating on each block separately.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.6.1115 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:16:y:1968:i:6:p:1115-1125

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().