摘要
为了便于建立与网络最大流问题有关的决策支持系统,本文给出一个求解网络最大流问题的数值算法,证明了算法的理论依据,并举例说明了算法的应用。该算法能求出网络最大流和最小截,并具有易于编程实现、收敛性好等优点,大量数值实验表明该算法非常实用有效。
For the convenience to build decision-making supporting system related to the problem of maximum flow in the transportation network, a numerical algorithm is presented for solving the problem of maximum flow in the transportation network by this paper. The theory, on which the algorithm depends, is verified strictly. An example is given to demonstrate the use of the algorithm. The algorithm, which can find the maximum flow and the minimum cut set in the transportation network, has the merits to be programmed easily and of good convergence, and many numerical experiments have verified its great practicability and effectiveness.
出处
《运筹与管理》
CSCD
2004年第4期37-40,共4页
Operations Research and Management Science
关键词
运筹学
决策支持系统
数值实验
运输网络
最大流
最小截
operations research
decision-making supporting system
numerical experiment
the tansportation network
maximum flow
minimum cut set
