Answers are grounded in this paper and cite their sources.
We derive a sufficient condition by which a multicommodity minimal cost network flow problem can be transformed and solved as an equivalent single-commodity problem. The condition is based on the topological structure of the network and unifies several special results that have been established. The transformation is given, and potential applications are discussed.
No takes yet. Share an insight, caveat, or question.
James R. Evans (1978) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: