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...
