Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1143458 | Operations Research Letters | 2006 | 5 Pages |
Abstract
We consider a multipath maximum flow problem introduced by Kishimoto (Networks 27(4)(1996)279-291). The focus is on efficient transformation from arc flows into multipath flows, where a multipath flow is a nonnegative combination of multipaths. A new algorithm that is more efficient than existing ones is proposed for the transformation.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Donglei Du, Santosh N. Kabadi,