Notes on Linear Programming: Part XXXVII
Concerning Multicommodity Networks
ResearchPublished 1956
A generalization of the minimum-cut, maximum-flow theorem to multicommodity networks. The generalization is expressed as a decomposition theorem that is established for these networks.
Topics
Document Details
- Copyright: RAND Corporation
- Availability: Web Only
- Year: 1956
- Pages: 13
- DOI: https://doi.org/10.7249/pubs
- Document Number: RM-1799
Citation
RAND Style Manual
Robacker, John T., Notes on Linear Programming: Part XXXVII: Concerning Multicommodity Networks, RAND Corporation, RM-1799, 1956. As of July 12, 2026: https://www.rand.org/pubs/research_memoranda/RM1799.html
Chicago Manual of Style
Robacker, John T., Notes on Linear Programming: Part XXXVII: Concerning Multicommodity Networks. Santa Monica, CA: RAND Corporation, 1956. https://www.rand.org/pubs/research_memoranda/RM1799.html.
This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.
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.
RAND 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.