| 网络最大流的割集矩阵算法 |
| |
| 引用本文： | 党耀国,刘思峰,方志耕. 网络最大流的割集矩阵算法[J]. 系统工程理论与实践, 2003, 23(9): 125-128. DOI: 10.12011/1000-6788(2003)9-125 |
| |
| 作者姓名： | 党耀国 刘思峰 方志耕 |
| |
| 作者单位： | (1)南京航空航天大学经济与管理学院;(2) 汽车管理学院车辆管理系 |
| |
| 基金项目： | 国家教育部博士学科点科研基金(20020287001)，南京航空航天大学特聘教授科研创新基金(1009-260812) |
| |
| 摘 要： | 利用网络单位流量及网络可行流的流量平衡关系,得出流量关系矩阵,由流量关系矩阵,得出网络割矩阵,从而求出网络图的割集,最后根据网络最大流等于最小割容量,求得网络最大流,此方法使得计算网络最大流变得简便,且具有很强的实用性.
|
| 关 键 词： | 网络最大流 流量 流量关系矩阵 最小割 |
| 文章编号： | 1000-6788(2003)09-0125-04 |
| 修稿时间： | 2002-06-19 |
Algorithm of Cutting-set Matrix on the Maximum Flows of Network |
| |
| Yao Guo DANG,Si Feng LIU,Zhi Geng FANG. Algorithm of Cutting-set Matrix on the Maximum Flows of Network[J]. Systems Engineering —Theory & Practice, 2003, 23(9): 125-128. DOI: 10.12011/1000-6788(2003)9-125 |
| |
| Authors: | Yao Guo DANG Si Feng LIU Zhi Geng FANG |
| |
| Affiliation: | (1)College of Economics and Management, Nanjing University of Aeronautics and Astronautics;(2)Auto Management Institute |
| |
| Abstract: | Cutting|sets are got through the matrix of the relationships of flows, which acquired with using the flows equilibrium relationships of the one unite in the network. Therefore, the maximum flow in the network is taken by use of that it equals to the minimum capacity of cutting-sets. The way of the algorithm in the paper is not only simpler but also more practicality than the other algorithm's. |
| |
| Keywords: | the maximum flows flows the matrix of the relationships of flows the minimum cutting-sets |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
|
点击此处可从《系统工程理论与实践》下载全文 |
