| 最大并流 |
| |
| 引用本文： | 汤泽滢,谢政.最大并流[J].运筹学学报,1998,2(3):10-14. |
| |
| 作者姓名： | 汤泽滢 谢政 |
| |
| 作者单位： | 国防科技大学!长沙，410073 |
| |
| 摘 要： | 本文根据运输问题中一类常见的情况建立了在并容量网络中求最大并流的网络模型，证明了最大并流问题的NP完全性，并给出了求解该问题的一种分枝定界算法．
|
| 关 键 词： | 最大并流 NP完全性 分枝定界 |
The Maximum Alternative-Flow |
| |
| ZEYING TANG, ZHENG XIE.The Maximum Alternative-Flow[J].OR Transactions,1998,2(3):10-14. |
| |
| Authors: | ZEYING TANG ZHENG XIE |
| |
| Institution: | National University of Defense Technology Chang Sha |
| |
| Abstract: | In this papers we build a model of finding the maximum alternative-flow in an alternativecapacity network according to a real example in transportation problem and prove its NPcompleteness. Finally, a branch-and-bound algorithm is presented. |
| |
| Keywords: | the maximum alternative-flow NP-completeness branch-and-bound |
| 本文献已被 CNKI 维普 等数据库收录！ |
