摘要
将网络最大流问题作了推广,给出了推广后的网络最大流GMF的标号算法及初始可行流计算的办法,并用线性规划的对偶理论说明了有关的结论。
The generalized problem of maximum flow is discussed here. The label algorithm and the initial feasible flow of GMF are obtained. The results are explained with the linear programming duality theory.
出处
《上海应用技术学院学报（自然科学版）》
2002年第4期238-242,共5页
Journal of Shanghai Institute of Technology: Natural Science
关键词
可行流
最大流
最小割
feasible flow
maximum flow
minimal cutiability
