| 运输网络的最优扩张 |
| |
| 引用本文： | 康文心.运输网络的最优扩张[J].河南科学,1993(1). |
| |
| 作者姓名： | 康文心 |
| |
| 作者单位： | 郑州大学系统科学与数学系 郑州 |
| |
| 摘 要： | 本文提出一个推广的运输问题,给出其一般解法,并用网络流理论探讨它与最小费用流问题的内在联系。同时进一步讨论运输问题“悖论”。
|
| 关 键 词： | 网络扩张 最小费用流 运输问题悖论 |
OPTIMAL EXTENSION OF TRASPORTATION NETWORKS |
| |
| Kang Wenxin Dept. of System Science & Maths. Zhengzhou Univ.,Zhengzhou.OPTIMAL EXTENSION OF TRASPORTATION NETWORKS[J].Henan Science,1993(1). |
| |
| Authors: | Kang Wenxin Dept of System Science & Maths Zhengzhou Univ Zhengzhou |
| |
| Institution: | Kang Wenxin Dept. of System Science & Maths. Zhengzhou Univ.,Zhengzhou 450052 |
| |
| Abstract: | In the present paper,a generalized transportation problem and an algorithm to solve it are proposed. We also exhibit its connection with the min-cost flow problem resorting the theory of network flow. The transportation paradox is discussed. |
| |
| Keywords: | Network extension Min-cost flow Transportation paradox |
| 本文献已被 CNKI 等数据库收录！ |
