A suggested computation for maximal multi-commodity network flows.
Purchase
Purchase Print Copy
| Format | List Price | Price | |
|---|---|---|---|
| Add to Cart | Paperback10 pages | $15.00 | $12.00 20% Web Discount |
A computation which uses the structure of one formulation of the multi-commodity problem within the framework of a simplex computation to determine maximal multi-commodity flows in networks. For this particular formulation, the number of variables is too large to be dealt with explicitly. The suggested computation treats nonbasic variables implicitly by replacing the pricing operation of the simplex method with several applications of a combinational algorithm for finding a shortest chain joining a pair of points in a network.
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.