| 一类两种商品的网络流问题 |
| |
| 引用本文： | 彭位炳.一类两种商品的网络流问题[J].湖北汽车工业学院学报,1997(1):44-48. |
| |
| 作者姓名： | 彭位炳 |
| |
| 摘 要： | 本文考虑在有两个发点x_1和x_2,两个收点y_1和y_2的网络中,要求把商品1从x_1运送到y_1,把商品2从x_2运送到y_2的最大流问题。给出一个充要条件,指出在一般情况下无最大流,但可以得到满意流。最后给出一个求满意流的算例。
|
| 关 键 词： | 满意流 汇流 |
On Two Commodity Network Flows |
| |
| Abstract: | In network about two sources x1, x2 and two sinks y1, y2, the problem of sending commodity 1 from source x1 to sink y1, and sending commodity 2 from source x2 to sink y2, giving a sufficient - essential condition and getting meet - flow without max - flow in common condition is solved. One examples are gived |
| |
| Keywords: | Meet - flow Flow together |
| 本文献已被 维普 等数据库收录！ |
|
