On Multi-Commodity Maximal Dynamic Flows

Mandell Bellmore and Ramakrishna R. Vemuganti
Additional contact information
Mandell Bellmore: The Johns Hopkins University, Baltimore, Maryland
Ramakrishna R. Vemuganti: The Johns Hopkins University, Baltimore, Maryland

Operations Research, 1973, vol. 21, issue 1, 10-21

Abstract: Ford and Fulkerson have shown that a single-commodity maximal dynamic flow can be obtained by solving a transshipment problem associated with the static network and thereby finding the maximal temporally repeated dynamic flow. This flow is known to be an optimal dynamic flow. However, this result cannot be extended to the multi-commodity maximal dynamic flow problem. This paper shows that, for sufficiently large number of time periods, the difference between the multi-commodity maximal dynamic flow and the temporally repeated multi-commodity flow is bounded by a constant. In addition, it calculates this bound.

Date: 1973
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.21.1.10 (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:21:y:1973:i:1:p:10-21

Access Statistics for this article

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