|
つくばリポジトリ (Tulips-R) >
0 コンテンツタイプ別 (Content type) >
06 研究報告書 (Research paper) >
Department of Social Systems and Management Discussion Paper Series >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/2241/11458
|
| Title: | Outer approximation method for the minimum maximal flow problem |
| Authors: | Yamamoto, Yoshitsugu
Zenke, Daisuke
山本, 芳嗣
ヤマモト, ヨシツグ |
| Keywords: | network flow
minimum maximal flow
optimization over the efficient set
D.C. optimization
outer approximation
global optimization |
| Issue Date: | Apr-2005 |
| Publisher: | University of Tsukuba. Graduate School of Systems and Information Engineering. Doctoral Program in Social Systems & Management |
| Series/Report no.: | Department of Social Systems and Management Discussion Paper Series ~ no. 1115 |
| Abstract: | The minimum maximal flow problem is the problem of minimizing the flow value on the set
of maximal flows of a given network. The optimal value indicates how inefficiently the network can be
utilized in the presence of some uncontrollability. After extending the gap function characterizing the set
of maximal flows, we reformulate the problem as a D.C. optimization problem, and then propose an outer
approximation algorithm. The algorithm, based on the idea of ε-optimal solution and local search technique,
terminates after finitely many iterations with the optimal value of the problem. |
| URI: | http://hdl.handle.net/2241/11458 |
| Text Version: | author |
| Appears in Collections: | Department of Social Systems and Management Discussion Paper Series
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
