Study on Capacity Ezpansion Problems on mazimum flow
This article studies capacity expansion problems on maximum flow. The capacity expansion problems can be described as: how can the network capacity be increased as much as possible with a minimum total cost? In view of three types of expanding models: the node-expanding model, the arcexpanding model, the combination of the arc-expanding and node-expanding model; we discuss the characteristics of the problems separately. Considering the upper bound of the expansion capacity caused by every node or arc, we also present a unified capacity expansion formulation. Finally, an example is provided in detail.
directed networks mazimum flow polynomial algorithm capacity ezpansion
Liu Geng
School of Economics and Management China University of Geosciences Wuhan, China 430074
国际会议
大连
英文
1-4
2008-10-12（万方平台首次上网日期，不代表论文的发表时间）