Technical Note—A Single-Commodity Transformation for Certain Multicommodity Networks

Abstract

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.