Cover Image

A Suggested Computation for Maximal Multi-Commodity Network Flows

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.
Year of publication:
1958
Authors: L. R. Ford, Jr. ; Fulkerson, D. R.
Published in:
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 5.1958, 1, p. 97-101
Publisher: Institute for Operations Research and the Management Sciences - INFORMS
Online Resource
Check full text access |
Check Google Scholar
In libraries world-wide (WorldCat)
In German libraries (KVK)
subito order
I need help
Extent:
application/pdf
Type of publication: Article
Other identifiers:
10.1287/mnsc.5.1.97 [DOI]
Source:
Persistent link: https://www.econbiz.de/10009190612
Similar items by person