| 最大可行流问题中增值链的一种回溯求解算法 |
| |
| 引用本文： | 黄儿松,李光华.最大可行流问题中增值链的一种回溯求解算法[J].数字社区&智能家居,2006(12):96-97. |
| |
| 作者姓名： | 黄儿松 李光华 |
| |
| 作者单位： | 鹰潭职业技术学院计算机系,江西鹰潭335000 |
| |
| 摘 要： | 本文就最大可行流问题给出了一种回溯求解的算法，并证明了不可扩展结点的可剪裁性问题，旨在减少后续可能的搜索空间．在一定程度上可以减少求解过程中的时间消耗．
|
| 关 键 词： | 最大流 可行流 增值链 |
| 文章编号： | 1009-3044（2006）35-0096-02 |
| 收稿时间： | 2006-10-12 |
| 修稿时间： | 2006年10月12 |
The Retrospective Algorithm about Searching Augmenting Path of Maximum Feasible Flow Problem |
| |
| Huang Er-song,Li Guang-hua.The Retrospective Algorithm about Searching Augmenting Path of Maximum Feasible Flow Problem[J].Digital Community & Smart Home,2006(12):96-97. |
| |
| Authors: | Huang Er-song Li Guang-hua |
| |
| Abstract: | This paper provides an algorithm about the maximum feasible flow problem with retrospective method. and proves the feasibility to cut some node, which can not extend node during searching for augmenting path. so that it would not need search those nodes during later search, therefore, it cut down the consume of time. in some extent. |
| |
| Keywords: | Maximum flow feasible flow augmenting path |
| 本文献已被 维普 等数据库收录！ |
