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

S. M. Roberts and Benito Flores
Additional contact information
S. M. Roberts: IBM Federal Systems Division, Houston, Texas
Benito Flores: University of Houston, Houston, Texas

Operations Research, 1965, vol. 13, issue 1, 146-157

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.

Date: 1965
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.13.1.146 (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:13:y:1965:i:1:p:146-157

Access Statistics for this article

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