| 求解最小费用流的复合标号法 |
| |
| 引用本文： | 宁宣熙. 求解最小费用流的复合标号法[J]. 南京航空航天大学学报, 1989, 0(4) |
| |
| 作者姓名： | 宁宣熙 |
| |
| 作者单位： | 南京航空学院管理工程系 |
| |
| 摘 要： | 本文在求最短路和求最大流标号法的基础上,提出了求解最小费用流的复合标号法。利用这种方法可以在一次标号的过程中找到具有最小费用的增广链。该算法具有简单、易行、迭代次数少,而且易于理解的特点。
|
| 关 键 词： | 图论 标号法 网络法 网络流规划 最小费用流 |
A Mixed Labelling Algorithm for Solving Minimum Cost Flow Problem in the Network |
| |
| Ning Xuanxi. A Mixed Labelling Algorithm for Solving Minimum Cost Flow Problem in the Network[J]. Journal of Nanjing University of Aeronautics & Astronautics, 1989, 0(4) |
| |
| Authors: | Ning Xuanxi |
| |
| Affiliation: | Department of Industrial Engineering |
| |
| Abstract: | This paper presents a new mixed labelling algorithm for solving minimum cost flow problem on the basis of labelling algorithms for solving shortest path and maximum flow problems in the network. With the aid of the said method the augmentable chain with the minimum cost can be found in a single labelling process. This algorithm has the advantages of simplicity, feasibility, low computation cost and easy understanding. |
| |
| Keywords: | graph theory labelling algorithm network method network flow programming minimum cost flow |
| 本文献已被 CNKI 等数据库收录！ |
