摘要
最小费用流问题是网络理论研究的基本问题之一。本文推广了这个问题,提出了流值在一定范围内的最小费用流问题,给出了这个新问题的一个算法及其证明。
The minimal cost flow problem is the one of the basic problems innetwork. In this paper, this problem is extened. The problem of minimalcost flow for the flow value limited in fixed range and an lgorithm for thisnew problem and it's validity are proposed.
出处
《交通科学与工程》
1990年第4期77-83,共7页
Journal of Transport Science and Engineering
关键词
最小费用流
增量网络
最短路
增广链
minimal cost flow
incremental network
shortest path
augmentation chain
