摘要
给出一个求运输网络中的最小费用最大流的数值算法 ,证明了算法的理论依据 ,并举例说明算法的应用。
An numerical algorithm is presented for seeking the minimal cost maximal flow in the transportation network. The theory, which the algorithm depends on, is strictly verified. An example is given to demonstrate the use of the algorithm.
出处
《运筹与管理》
CSCD
2000年第4期33-38,共6页
Operations Research and Management Science
关键词
有向图
运输网络
最小费用最大流
the directed graph
the tansportation network
the minimal cost maximal flowL
