Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Ford et al. (1958) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: