A POLYNOMIAL-TIME ALGORITHM FOR THE GENERALIZED INDEPENDENT-FLOW PROBLEM
-
- Eguchi Akinobu
- Panasonic Mobile Communications Co., Ltd.
-
- Fujishige Satoru
- Kyoto University
-
- Takabatake Takashi
- Kochi Gakuen College
Bibliographic Information
- Other Title
-
- Polynomial Time Algorithm for the Generalized Independent Flow Problem
Search this article
Description
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.
Journal
-
- Journal of the Operations Research Society of Japan
-
Journal of the Operations Research Society of Japan 47 (1), 1-17, 2004
The Operations Research Society of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1390282679087332480
-
- NII Article ID
- 110001183588
-
- NII Book ID
- AA00703935
-
- ISSN
- 21888299
- 04534514
-
- NDL BIB ID
- 6888695
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed