A binary search algorithm for the generalized maximum balanced flow problem
この論文をさがす
説明
We consider the generalized maximum balanced flow problem (GMBF), i.e., the problem of finding a generalized maximum flow in a network such that each arc-flow value is bounded by a given fixed proportion of the total flow value of a generalized flow, and propose a polynomial algorithm for this problem. Problem (GMBF) can be regarded as a generalization of the maximum balanced flow problem (MBF) for which several efficient algorithms have been proposed by Minoux and Zimmermann, etc.
収録刊行物
-
- 日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集
-
日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集 2000 206-207, 2000-09-27
公益社団法人日本オペレーションズ・リサーチ学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1570291227489635968
-
- NII論文ID
- 110003478636
-
- NII書誌ID
- AN00351192
-
- 本文言語コード
- en
-
- データソース種別
-
- CiNii Articles
