Work

Outer Approximation Method for the Minimum Maximal Flow Problem

Year: 2007

Type: article

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.

Source: Journal of the Operations Research Society of Japan

DOI: 10.15807/jorsj.50.14

Authors: Yoshitsugu Yamamoto, Daisuke Zenke

Institutions: University of Tsukuba, Ministry of Defense

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: Japan Society for the Promotion of Science

Award: Analysis and Visualization of Asymmetric Geographical Data