The simplex method for integral multicommodity networks
James R. Evans · Naval Research Logistics Quarterly · 1978
Abstract The simplex method is interpreted as a labeling procedure for certain classes of multicommodity flow problems in a manner similar to that for single commodity networks. As opposed to general multicommodity algorithms, no explicit matrix inversion is required; all simplex operations are performed graph‐theoretically.