Letter to the Editor—A Multicommodity Max-Flow Algorithm

Published Online:https://doi.org/10.1287/opre.16.6.1234

Some simplifications occur when the theory of Kornai and Liptak is applied to the multicommodity max-flow problem. This note describes the resulting algorithm and comments on some of its properties; it is flexible, easy to code, and involves simple computations. However, the technique is recommended for suboptimization because of its poor convergence properties.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.