Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms

Abstract

This note presents our computational experience using specialized techniques for solving multicommodity network flow problems. The algorithms investigated include a price-directive decomposition procedure, a resource-directive decomposition procedure using subgradient optimization, and a primal partitioning procedure.