Comments on a Paper by W. Rothfarb, N. P. Schein, and I. T. Frisch
"Common Terminal Multicommodity Flow"
Expert InsightsPublished 1968
The article "Common Terminal Multicommodity Flow," published in the January-February 1968 edition of Operations Research, describes an algorithm that solves a specific class of common terminal multicommodity network flow problems. The problem formulated in this Paper and the algorithms that appear in references cited show that this class of problem can also be formulated as single-commodity minimal cost flow problems for which a number of solution techniques have been developed. 3 pp. Refs. (LK)
Document Details
- Copyright: RAND Corporation
- Availability: Web Only
- Year: 1968
- DOI: https://doi.org/10.7249/P3932
- Document Number: P-3932
Citation
RAND Style Manual
Chicago Manual of Style
This publication is part of the RAND paper series. The paper series was a product of RAND 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.
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.