Article ID: | iaor2005715 |
Country: | China |
Volume: | 33 |
Issue: | 5 |
Start Page Number: | 43 |
End Page Number: | 48 |
Publication Date: | May 2003 |
Journal: | Mathematics in Practice and Theory |
Authors: | Lu Husheng, Gao Xuedong, Wu Sen |
A maximum profit flows (MPF) problem is a network optimization problem aiming to get maximum transport profit. A feasible MPF can be decomposed into a few path flows and a few circle flows, and consequently the profit of MPF is divided into the profit of those path flows and circle flows. We present a basic algorithm to find the solution by augmenting flow on profit augmenting path until no path exists based on the theorem that a feasible flow