An algorithm that finds the five least-cost sequences for scheduling military personnel through a series of courses where the costs incurred are transportation costs. The algorithm adapts the implicit enumeration approach of integer programming to this pipeline flow problem and will require at least [(n - 2.8)n]' fewer computations than total enumeration, where [n] is the number of courses. It can also be used to determine the least-cost sequences when mixed travel modes are involved.
This report is part of the RAND Corporation Report series. The report was a product of the RAND Corporation from 1948 to 1993 that represented the principal publication documenting and transmitting RAND's major research findings and final research.
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.