| 带有模糊容量限制的网络中的最佳最小费用最大流 |
| |
| 引用本文： | 谢政,汤泽滢.带有模糊容量限制的网络中的最佳最小费用最大流[J].模糊系统与数学,1996(1). |
| |
| 作者姓名： | 谢政 汤泽滢 |
| |
| 作者单位： | 国防科技大学系统工程与数学系 |
| |
| 摘 要： | 本文主要讨论当网络中的弧容量限制和最大流目标要求带有模糊性时的最小费用最大流问题，通过构造带费用的增量网络并设法寻找其中的最佳最小费用路，给出了求解这类模糊网络流问题的算法。
|
| 关 键 词： | 最佳最小费用最大流 最佳最小费用路 极小最佳路子网络 |
The Optimal Minimum-cost Maximum Flow in Network with Fuzzy Capacity Constraints |
| |
| Xie Zheng and Tang Zeying.The Optimal Minimum-cost Maximum Flow in Network with Fuzzy Capacity Constraints[J].Fuzzy Systems and Mathematics,1996(1). |
| |
| Authors: | Xie Zheng and Tang Zeying |
| |
| Abstract: | In this paper, the minimum--cost maximum flow problem is discussed where thearc capacity constraints and the goal requirement concerning the maximum flow value innetwork are fuzzy. By constructing the incremental networks with cost and trying tosearch the optimal minimum-cost path in it, an algorithm for the kind of fuzzy networkflow problem is presented. |
| |
| Keywords: | Optimal minimum-cost maximum flow Optimal minimum-costpath Minimal subnetwork of the optimal path |
| 本文献已被 CNKI 等数据库收录！ |
