On DC optimization algorithms for solving minmax flow problems
- 198 Downloads
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.
KeywordsMinmax flow problem Smooth DC optimization Regularization
We would like to thank the Associate Editor and the anonymous referees for their useful suggestions, comments and remarks on the paper, which helped us very much in revising the paper.
- Iri M (1994) An essay in the theory of uncontrollable flows and congestion, Technical Report, Department of Information and System Engineering, Faculty of Science and Engineering, Chuo University, TRISE 94–03Google Scholar
- Luc LT, Muu LD (1997) A global optimization approach to optimization over the efficient set. In: Lecture notes in economics and mathematical systems, Springer, Berlin, 452, pp 183–196Google Scholar
- Tao PD (1986) Algorithms for solving a class of non convex optimization. Methods of subgradients, Fecmat Days 85, Mathematics for Optimization, Elservier Sience Publishers, B.V. NorthHollandGoogle Scholar
- Zenke D (2006) Algorithms for the minimum maximal flow problem—optimization over the efficient set, Graduate School of Systems and Information Engineering, University of TsukubaGoogle Scholar