Multicommodity network-flow problem
- 27 Downloads
This is a minimum-cost network flow problem in which more than one commodity simultaneously flows from the supply nodes to the demand nodes. Unlike the single commodity problem, an optimal solution is not guaranteed to have integer flows. The problem takes on the block-angular matrix form that is suitable for solution by Dantzig-Wolfe decomposition. Applications areas include communications, traffic and logistics. Dantzig-Wolfe decomposition; Minimum-cost network-flow problem; Multicommodity network flows; Network optimization.