| Article ID: | iaor20082013 |
| Country: | Japan |
| Volume: | 50 |
| Issue: | 1 |
| Start Page Number: | 14 |
| End Page Number: | 30 |
| Publication Date: | Mar 2007 |
| Journal: | Journal of the Operations Research Society of Japan |
| Authors: | Yamamoto Yoshitsugu, Zenke Daisuke |
| Keywords: | networks: flow, optimization, programming: branch and bound, programming: mathematical |
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.