| 引用本文: | 谢政.分段线性凸费用网络流的两个算法.[J].国防科技大学学报,1989,11(2):33-39.[点击复制] |
| 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[点击复制] |
|
| |
|
|
| 本文已被：浏览 5254次 下载 5177次 |
| 分段线性凸费用网络流的两个算法 |
| 谢政 |
|
(系统工程与应用数学系)
|
| 摘要: |
| 本文讨论了分段线性凸费用网络流问题，推广了线性费用网络流中的负回路方法和最小费用路方法，从而得到了求分段线性凸费用网络的最小费用流的两个算法。 |
| 关键词: 运筹学，网络流图，算法 分段线性凸费用网络，可行流，最小费用流，负回路，最小费用路 |
| DOI： |
| 投稿日期：1987-11-03 |
| 基金项目: |
|
| Two Algorithms for Piecewise-Linear Convex Cost Network Flow Problems |
| Xie Zheng |
|
(Department of Applied Mathematics and System Engineering)
|
| 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 to solve the minimum cost network flow problem with piecewise-linear convex cost. |
| Keywords: operations research,network flows,algorithms piecewise-linear convex cost network flow,feasible flow,minimum cost flow,negative circuit,shortest cost path |
|
|
