Back to Search Start Over

REDUCING THE MEMORY REQUIREMENTS OF DYNAMIC PROGRAMMING.

Authors :
Wong, Peter J.
Luenberger, David G.
Source :
Operations Research; Nov/Dec68, Vol. 16 Issue 6, p1115, 11p
Publication Year :
1968

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. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
DECOMPOSITION method
DYNAMIC programming
COMPUTER programming
MEMORY
MATHEMATICAL models
TECHNICAL specifications
ANALYTIC geometry
MATHEMATICAL programming

Details

Language :
English
ISSN :
0030364X
Volume :
16
Issue :
6
Database :
Complementary Index
Journal :
Operations Research
Publication Type :
Academic Journal
Accession number :
4469295
Full Text :
https://doi.org/10.1287/opre.16.6.1115
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details