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

Letter to the Editor—Solution of a Combinatorial Problem by Dynamic Programming

Author

Listed:
  • S. M. Roberts

    (IBM Federal Systems Division, Houston, Texas)

  • Benito Flores

    (University of Houston, Houston, Texas)

Abstract

A combinatorial problem to determine the least cost of a matrix configuration is solved by dynamic programming. In particular, the application of an algorithm based on an approximation in policy space yields a least-cost configuration consistent with the initial matrix configuration. While the optimization is local in character because of its dependence on the initial matrix configuration, the optimization may be extended to approach global optimization by consideration of a variety of initial matrix configurations. The method lends itself readily to finding the hierachy of configurations ranging from the least to the most expensive.

Suggested Citation

  • S. M. Roberts & Benito Flores, 1965. "Letter to the Editor—Solution of a Combinatorial Problem by Dynamic Programming," Operations Research, INFORMS, vol. 13(1), pages 146-157, February.
    • Handle: RePEc:inm:oropre:v:13:y:1965:i:1:p:146-157
    DOI: 10.1287/opre.13.1.146
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.13.1.146
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.13.1.146?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
    ---><---

    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:13:y:1965:i:1:p:146-157. 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.