摘要
对多收点容量网络最小费用流问题，证明了当收点处的净流入量增加时。
This paper proves that for minimum cost flow problems in multisinks capacitated assigment networks, the rate of increase in each sink of total minimum cost increases with the increase in net flow into those sinks.
出处
《铁道师院学报》
1998年第4期1-3,共3页
Journal of Suzhou Railway Teachers College(Natural Science Edition)
关键词
多收点容量网络
最小费用流
次梯度
网络流
multisinks capacitated assigment network, minimum cost flow problem, flow augmenting chain, subgradient
