|
|||||
|
|
| 分段线性凸费用网络流的两个算法 | |
| 引用本文： | 谢政. 分段线性凸费用网络流的两个算法[J]. 国防科技大学学报, 1989, 11(2): 33-39 |
| 作者姓名： | 谢政 |
| 作者单位： | 国防科技大学系统工程与应用数学系 |
| 摘 要： | 本文讨论了分段线性凸费用网络流问题,推广了线性费用网络流中的负回路方法和最小费用路方法,从而得到了求分段线性凸费用网络的最小费用流的两个算法。 |
| 关 键 词： | 运筹学 网络流图 算法 分段线性凸费用网络 可行流 最小费用流 负回路 最小费用路 |
| 收稿时间： | 1987-11-03 |
Two Algorithms for Piecewise-Linear Convex Cost Network Flow Problems |
|
| Xie Zheng. Two Algorithms for Piecewise-Linear Convex Cost Network Flow Problems[J]. Journal of National University of Defense Technology, 1989, 11(2): 33-39 | |
| Authors: | Xie Zheng |
| Abstract: | In this paper, the piecewise-linear convex cost network flow is discussed.The methods of the negative circuit and the shortest cost path for the linear cost network flow problems are extended, thus obtaining two simple algorithms tosolve the minimum cost network flow problem with piecewise-linear convexcost. |
| Keywords: | operations research network flows algorithms piecewise-linear convex cost network flow feasible flow minimum cost flow negative circuit shortest cost path |
| 本文献已被 CNKI 等数据库收录！ | |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 | |
| 点击此处可从《国防科技大学学报》下载免费的PDF全文 | |