The Research of Optimization Algorithm of Network Capacity Expansion with Constraints

摘要：

When the capacity of a network is expanded, the investment cost should be taken into consideration. We hope to obtain the largest capacity expansion with minimum investment cost. This paper utilizes the labeling algorithm of maximum flow to find out bottleneck arcs and discusses Network Capacity Expansion with Minimum Cost (NCEMC) in two aspects. Then a mathematical model for the NCEMC problem is given and the corresponding capacity expansion algorithm and theoretical analysis are presented.

作者: Kaihua Xu Yuhua Liu Hao Huang Haiyan Zhu

作者单位: Research Center of the Digital Space Technology Central China Normal University Wuhan, P.R China 430 Department of Computer Science Central China Normal University Wuhan, P.R. China 430079

会议类型: 国际会议

会议名称: 第三届国际脉冲动力系统及应用学术会议

会议地点: 青岛

会议语种:英文

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