An algorithm for maximum profit flows

An algorithm for maximum profit flows

0.00 Avg rating0 Votes
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: , ,
Abstract:

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 fmax is a maximum profit flow if and only if there is no augmenting path with respect to fmax.

Reviews

Required fields are marked *. Your email address will not be published.