A Suggested Computation for Maximal Multi-Commodity Network Flows

L. R. Ford, Jr. and D. R. Fulkerson
Additional contact information
L. R. Ford, Jr.: The RAND Corporation, Santa Monica, California
D. R. Fulkerson: The RAND Corporation, Santa Monica, California

Management Science, 2004, vol. 50, issue 12_supplement, 1778-1780

Abstract: (This article originally appeared in Management Science, October 1958, Volume 5, Number 1, pp. 97--101, published by The Institute of Management Sciences.) A simplex computation for an arc-chain formulation of the maximal multi-commodity network flow problem is proposed. Since the number of variables in this formulation is too large to be dealt with explicitly, the computation treats non-basic variables implicitly by replacing the usual method of determining a vector to enter the basis with several applications of a combinatorial algorithm for finding a shortest chain joining a pair of points in a network.

Date: 2004
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.1040.0269 (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:ormnsc:v:50:y:2004:i:12_supplement:p:1778-1780

Access Statistics for this article

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