| 关于多收点容量网络最小费用流的一个问题 |
| |
| 引用本文： | 颜铁成. 关于多收点容量网络最小费用流的一个问题[J]. 苏州科技学院学报(社会科学版), 1998, 0(4) |
| |
| 作者姓名： | 颜铁成 |
| |
| 作者单位： | 苏州铁道师范学院人事处 苏州215009 |
| |
| 摘 要： | 对多收点容量网络最小费用流问题,证明了当收点处的净流入量增加时,其总的最小费用沿着该收点的方向的增长速率也相应增加。
|
| 关 键 词： | 多收点容量网络 最小费用流 增广链 次梯度 |
A Problem on Minimum Cost Flow of Multisinks Capacitated Assigment Networks |
| |
| Yan Tiecheng. A Problem on Minimum Cost Flow of Multisinks Capacitated Assigment Networks[J]. Journal of University of Science and Technology of Suzhou:Social Science, 1998, 0(4) |
| |
| Authors: | Yan Tiecheng |
| |
| Abstract: | This paper proves that for minimum cost flow problems in multisinks capaci- tated assigment networks,the rate of increase in each sink of total minimum cost increases with the increase in net flow into those sinks. |
| |
| Keywords: | multisinks capacitated assigment network minimum cost flow problem flow augmenting chain subgradient |
| 本文献已被 CNKI 等数据库收录！ |
