- 【Updated on May 12, 2025】 Integration of CiNii Dissertations and CiNii Books into CiNii Research
- Trial version of CiNii Research Knowledge Graph Search feature is available on CiNii Labs
- Suspension and deletion of data provided by Nikkei BP
- Regarding the recording of “Research Data” and “Evidence Data”
A binary search algorithm for the generalized maximum balanced flow problem
-
- NAKAYAMA Akira
- 福島大学行政社会学部
-
- SU Chien Fei
- 福島大学大学院地域政策科学研究科
Search this article
Description
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.
Journal
-
- 日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集
-
日本オペレーションズ・リサーチ学会秋季研究発表会アブストラクト集 2000 206-207, 2000-09-27
The Operations Research Society of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1570291227489635968
-
- NII Article ID
- 110003478636
-
- NII Book ID
- AN00351192
-
- Text Lang
- en
-
- Data Source
-
- CiNii Articles