Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- 1 August 1980
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 28 (4) , 995-1000
- https://doi.org/10.1287/opre.28.4.995
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.Keywords
This publication has 0 references indexed in Scilit: