| 网络最大流的图单纯形解法 |
| |
| 引用本文： | 宁宣熙.网络最大流的图单纯形解法[J].南京航空航天大学学报,1996,28(5):626-630. |
| |
| 作者姓名： | 宁宣熙 |
| |
| 作者单位： | 南京航空航天大学工商学院 |
| |
| 摘 要： | 提出网络饱和流的概念，重新定义了网络最大流问题，并提出了求解最大流的图单纯形算法。该方法避免了２Ｆ算法的缺点，其计算复杂性为Ｏ（２ｍｎ）。
|
| 关 键 词： | 图论 网络流 最大流 |
Graph Simplex Method for Solution of Maximum Flow Problem in a Network |
| |
| Ning Xuanxi.Graph Simplex Method for Solution of Maximum Flow Problem in a Network[J].Journal of Nanjing University of Aeronautics & Astronautics,1996,28(5):626-630. |
| |
| Authors: | Ning Xuanxi |
| |
| Abstract: | The maximum flow problem is redefined by using the concept of saturated flow of a network, and a new method for solving the maximum flow problem,called the Graph Simplex Algorithm is presented. With this method, the shortcomings in 2F algorithm are avoided and the complexity of O(2mn) is achieved. |
| |
| Keywords: | graph theory network flows maximum flow |
| 本文献已被 CNKI 维普 等数据库收录！ |
