Solving Minimum Mazimal Network Flow Problem using Outer Approzimation

摘要：

We consider the minimum maximal flow problem. This problem is known as an NP-hard problem. In this research, we formulate this problem as a concave minimization problem over a convex set. We propose an algorithm based upon an outer approximation strategy to solve this problem.

关键词： minimum mazimal flow d.c. optimization outer approzimation

作者: Jianming Shi Sukwon Chung Wenjie Chen

作者单位: Muroran Institute of Technology, Japan Stanford University, USA

会议类型: 国际会议

会议名称: The First World Congress on Global Optimization in Engineering & Science(第一届工程与科学全局优化国际会议 WCGO2009)

会议地点: 长沙

会议语种:英文

页码: 286-291

在线出版日期: 2009-06-01（万方平台首次上网日期，不代表论文的发表时间）