A polynomial-time algorithm for the generalized independent-flow problem

A polynomial-time algorithm for the generalized independent-flow problem

0.00 Avg rating0 Votes
Article ID: iaor20043282
Country: Japan
Volume: 47
Issue: 1
Start Page Number: 1
End Page Number: 17
Publication Date: Mar 2004
Journal: Journal of the Operations Research Society of Japan
Authors: , ,
Keywords: optimization, programming: mathematical, programming: network
Abstract:

We consider a compound problem of the generalized minimum-cost flow problem and the independent-flow problem, which we call the generalized independent-flow problem. The generalized minimum-cost flow problem is to find a minimum-cost flow in a capacitated network with gains, where each arc flow is multiplied by a gain factor when going through an arc. On the other hand, the independent-flow problem due to Fujishige is to find a minimum-cost flow in a multiple-source multiple-sink capacitated network with submodular constraints on the set of supply vectors on the source vertex set and on the set of demand vectors on the sink vertex set. We present a polynomial-time algorithm for the generalized independent-flow problem, based on Wayne's algorithm for generalized minimum-cost flows and Fujishige's algorithm for independent flows, which can be regarded as an extension of Wallacher and Zimmermann's submodular flow algorithm.

Reviews

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