Letter to the Editor—Common Terminal Multicommodity Flow

W. Rothfarb, N. P. Shein and I. T. Frisch
Additional contact information
W. Rothfarb: University of California, Berkeley, California
N. P. Shein: University of California, Berkeley, California
I. T. Frisch: University of California, Berkeley, California

Operations Research, 1968, vol. 16, issue 1, 202-205

Abstract: An algorithm is presented to determine a multicommodity flow pattern which maximizes the objective function ∑ i = n i =1 α i f i for graphs having n sources and a common terminal, where f i is the amount of flow of the i th commodity and α i is a given set of nonnegative constants.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.1.202 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:16:y:1968:i:1:p:202-205

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().