This paper concerns a minimum maximal flow (MMF) problem, which finds a minimum maximal flow in a given network. The problem is known to be NP-hard. We show that the MMF problem can be formulated as a mixed integer programming (MIP) problem and we propose to find the minimum maximal flow by solving the MIP problem.

By performing computational experiments, we observe that the proposed approach is efficient to the MMF problem even for relatively large instances, where the number of edges is up to 15,000, and that the growth rate of running time of our approach is slower than the rates of previous works when the sizes of the instances grow.