On a routing problem
An attempt to determine an optimal route from one point to another, given a set of N cities, with every two linked by a road, and the times required to transverse these roads. The times are not directly proportional to the distances because of the varying quality of roads and quantities of traffic. The functional equation technique of dynamic programming, combined with approximation in policy space, yields an iterative algorithm which converges after a finite number if iterations bounded in advance.
- Format:
- Paperback, 1 Pages
- Year:
- 1956
- List Price:
- $15.00
- Price:
- $12.00 Special 20% Web Discount
Document Details
- Copyright: RAND Corporation
- Availability: Available
- Format: Paperback
- Pages: 1
- List Price: $15.00
- Price: $12.00
- Document Number: P-1000
- Year: 1956
- Series: Papers
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.
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.
RAND® is a registered trademark. Copyright © 1994-2012 RAND Corporation.