On DC. optimization algorithms for solving minmax flow problems

We formulate minmax flow problems as a DC. optimization problem. We then apply a DC. primal-dual algorithm to solve the resulting problem. The obtained computational results show that the proposed algorithm is efficient thanks to particular structures of the minmax flow problems. Keywords: Minmax flow problem smooth DC optimization regularization.