article

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

Authors:

S. M. Roberts,

Benito FloresAuthors Info & Claims

Operations Research, Volume 13, Issue 1

Pages 146 - 157

https://doi.org/10.1287/opre.13.1.146

Published: 01 February 1965 Publication History

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.

References

[1]

R. BELLMAN, Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1951.

Crossref

Google Scholar

[2]

R. BELLMAN AND S. DREYFUS, Applied Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1962.

Google Scholar

[3]

B. FLORES, "Quantitative Tools for Plant Layout," MS Thesis, University of Houston, 1964.

Google Scholar

[4]

S. REITER AND G. SHERMAN, "Discrete Optimizing," Purdue University Institute Paper No. 37.

Google Scholar

[5]

S. M. ROBERTS, Dynamic Programming in Chemical Engineering and Process Control, Academic Press, New York, 1964.

Google Scholar

Cited By

View all

Warnecke HDangelmaier W(1981)Layoutplanung -- der Stand der TechnikOR Spectrum10.1007/BF017211933:1(1-20)Online publication date: 1-Mar-1981
https://dl.acm.org/doi/10.1007/BF01721193
Francis RGoldstein J(1974)Technical Note-Location TheoryOperations Research10.1287/opre.22.2.40022:2(400-410)Online publication date: 1-Apr-1974
https://dl.acm.org/doi/10.1287/opre.22.2.400
Roberts SFlores B(1966)An Engineering Approach to the Traveling Salesman ProblemManagement Science10.1287/mnsc.13.3.26913:3(269-288)Online publication date: 1-Nov-1966
https://dl.acm.org/doi/10.1287/mnsc.13.3.269

Letter to the Editor-Solution of a Combinatorial Problem by Dynamic Programming
1. Information systems
  1. Data management systems
    1. Database administration
2. Theory of computation
  1. Design and analysis of algorithms
    1. Algorithm design techniques

Recommendations

Letter to the Editor: A condition for the nonsymmetric saddle point matrix being diagonalizable and having real and positive eigenvalues

This paper discusses the spectral properties of the nonsymmetric saddle point matrices of the form A=[AB^T;-BC] with A symmetric positive definite, B full rank, and C symmetric positive semidefinite. A new sufficient condition is obtained so that A is ...
Letter to the editor: A new algorithm for linear systems of the Pascal type

In this paper, we give an algorithm for solving linear systems of the Pascal matrices. The method is based on the explicit factorization of the Pascal matrices. The algorithm costs no multiplications and O(n^2) additions. The linear systems of the ...
Letter to the editor: Stability analysis of block LU factorization for complex symmetric block tridiagonal matrices

The existence of block LU factorization without pivoting for complex symmetric block tridiagonal matrices whose real and imaginary parts are positive definite and every block has the same property is assured. Some properties of the factors of the block ...

Comments

Information & Contributors

Information

Published In

Operations Research Volume 13, Issue 1

February 1965

180 pages

ISSN:0030-364X

Issue’s Table of Contents

Publisher

INFORMS

Linthicum, MD, United States

Publication History

Published: 01 February 1965

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Warnecke HDangelmaier W(1981)Layoutplanung -- der Stand der TechnikOR Spectrum10.1007/BF017211933:1(1-20)Online publication date: 1-Mar-1981
https://dl.acm.org/doi/10.1007/BF01721193
Francis RGoldstein J(1974)Technical Note-Location TheoryOperations Research10.1287/opre.22.2.40022:2(400-410)Online publication date: 1-Apr-1974
https://dl.acm.org/doi/10.1287/opre.22.2.400
Roberts SFlores B(1966)An Engineering Approach to the Traveling Salesman ProblemManagement Science10.1287/mnsc.13.3.26913:3(269-288)Online publication date: 1-Nov-1966
https://dl.acm.org/doi/10.1287/mnsc.13.3.269

Abstract

References

Cited By

Recommendations

Letter to the Editor: A condition for the nonsymmetric saddle point matrix being diagonalizable and having real and positive eigenvalues

Letter to the editor: A new algorithm for linear systems of the Pascal type

Letter to the editor: Stability analysis of block LU factorization for complex symmetric block tridiagonal matrices

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations