Combinatorial processes and dynamic programming.
Purchase
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback65 pages | $15.00 | $12.00 20% Web Discount |
A discussion of the application of dynamic-programming techniques to a class of combinatorial problems. The essential difficulty of these problems appears in their apparent lack of complexity, as it is usually either a question of performing a finite set of arithmetic operations or of determining the largest of a finite set of numbers. Although no specific numerical results are presented, references to extensive computational studies of S. E. Dreyfus and the author are given. 65 pp.
This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.
This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.
The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.