| 多源点网络流图的计算机解法 |
| |
| 引用本文： | 王可定,封树标.多源点网络流图的计算机解法[J].系统工程理论与实践,1994,14(8):76-80. |
| |
| 作者姓名： | 王可定 封树标 |
| |
| 作者单位： | 1. 南京工程兵工程学院;2. 天津解放军运输工程学院 |
| |
| 摘 要： | 多源点网络流图的计算机解法王可定，封树标（南京工程兵工程学院，南京２１０００７）（天津解放军运输工程学院，天津，３００１６１）ＡＣｏｍｐｕｔｅｒＡｌｇｏｒｉｔｈｍｆｏｒＳｏｌｖｉｎｇＭｕｌｔｉ—ＳｅｕｒｃｅＦｌｏｗＮｅｔｗｏｒｋＷａｎｇＫｅｄｉｎｇ（...
|
| 关 键 词： | 点网络 结点 计算机解法 外部流 运输网络 线路 网络最大流 应急疏散 源点 集的容量 |
| 收稿时间： | 1991-08-04 |
A Computer Algorithm for Solving Multi Seurce Flow Network |
| |
| Wang Keding,Feng Shubiao.A Computer Algorithm for Solving Multi Seurce Flow Network[J].Systems Engineering —Theory & Practice,1994,14(8):76-80. |
| |
| Authors: | Wang Keding Feng Shubiao |
| |
| Institution: | 1. Engineer Institute of Engineering,Nanjing 210007;2. Institute of Transport Engineering of The PLA,Tianjin 300161 |
| |
| Abstract: | This paper provides a computer algorithm for solving multi-source transport network,On the base to store the datum of the transport network into computer,the network model is expressed as algebraic model by using program theory. After that,flow on each edge and exter-nal flow at each source point are optimized by a recurrence algorithm. The alogrithm has been worked out as a normal software by authors,that is considered to have much practicality and ex-tended valuation. |
| |
| Keywords: | |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
