摘要
网络最大流的理论与方法在运输与网络管理中有着重要的应用。受在管道中冲塞物体的原理的启发,本文提出了一种新的求解网络最大流的方法,该方法较以往的解法有一些特别的优点。
The theory and the method solving maximal flow through network are widely applied in transportation and network management.Enlighted by principium pressing an object into a pipe,we present a new method to solve problems of maximal flow through network in this paper.It has some advantages over existing methods.
出处
《运筹与管理》
CSCD
2003年第3期38-42,共5页
Operations Research and Management Science
关键词
运筹学
网络最大流
“冲塞式”算法
约束条件
多端网络
冲塞物体
opreations research
pressing method
maximal flow through network
network with restrictions or ports
