| 运输网络中求最小费用最大流的一个算法 |
| |
| 引用本文： | 谢凡荣. 运输网络中求最小费用最大流的一个算法[J]. 运筹与管理, 2000, 9(4): 33-38 |
| |
| 作者姓名： | 谢凡荣 |
| |
| 作者单位： | 江西经济管理干部学院基础部，南昌330200 |
| |
| 摘 要： | 给出一个求动输网络中的最小费用最大流的数值算法，证明了算法的理论依据，并举例说明算法的应用。
|
| 关 键 词： | 有向图 运输网络 最小费用最大流 |
An Algorithm for Seeking the Minimal Cost Maximal Flow in the Transportation Network |
| |
| XIE Fan rong. An Algorithm for Seeking the Minimal Cost Maximal Flow in the Transportation Network[J]. Operations Research and Management Science, 2000, 9(4): 33-38 |
| |
| Authors: | XIE Fan rong |
| |
| Abstract: | An numerical algorithm is presented for seeking the minimal cost maximal flow in the transportation network. The theory, which the algorithm depends on, is strictly verified. An example is given to demonstrate the use of the algorithm. |
| |
| Keywords: | the directed graph the tansportation network the minimal cost maximal flowL |
| 本文献已被 CNKI 维普 等数据库收录！ |
