| (V_s,V_t)平面双流网络中的最小费用最大双流 |
| |
| 引用本文： | 谢政,肖予钦.(V_s,V_t)平面双流网络中的最小费用最大双流[J].数学理论与应用,1999(3). |
| |
| 作者姓名： | 谢政 肖予钦 |
| |
| 作者单位： | 国防科技大学系统工程与数学系!410073 |
| |
| 摘 要： | 本文利用（υ_ｓ，υ_ｔ）平面双流网络的平面性，找出并证明了该网络中最小费用双流的充要条件，最后给出了一个算法并估计了复杂性．
|
| 关 键 词： | Berge算法 最上路 瓶颈 |
Minimum Cost Maximum Double-Flow in (v_s,v_t) Planar Double-Flow Networks |
| |
| Zheng Xie Yu qin Xiao.Minimum Cost Maximum Double-Flow in (v_s,v_t) Planar Double-Flow Networks[J].Mathematical Theory and Applications,1999(3). |
| |
| Authors: | Zheng Xie Yu qin Xiao |
| |
| Abstract: | This paper takes advantage of the planarity in (v_s,v_t) planar double-flow networks. We have got and proved the necessary and sufficient conditions of minimum cost maximum double-flow. Finally an algorithm and its complexity are given. |
| |
| Keywords: | Berge's Algorithm the Uppermost Path Bottleneck |
| 本文献已被 CNKI 等数据库收录！ |
