IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v16y1968i6p1115-1125.html
   My bibliography  Save this article

Reducing the Memory Requirements of Dynamic Programming

Author

Listed:
  • 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)

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.

Suggested Citation

  • Peter J. Wong & David G. Luenberger, 1968. "Reducing the Memory Requirements of Dynamic Programming," Operations Research, INFORMS, vol. 16(6), pages 1115-1125, December.
    • Handle: RePEc:inm:oropre:v:16:y:1968:i:6:p:1115-1125
    DOI: 10.1287/opre.16.6.1115
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.16.6.1115
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.16.6.1115?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vinay Dharmadhikari, 1975. "Decision-Stage Method: Convergence Proof, Special Application, and Computation Experience," NBER Working Papers 0094, National Bureau of Economic Research, Inc.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:16:y:1968:i:6:p:1115-1125. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.