Minimum-Cost Multicommodity Network Flows

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

The minimum-cost multicommodity network flow problem is formulated in both node-arc and arc-chain form, leading to very large linear programs. The special structure of these programs is utilized in algorithms for their solution.

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.