摘要
对弧的容量带上下界约束的最大流问题进行了讨论,给出带上下界约束的最大流问题的数学模型和求解算法,即将求解带上下限的网络最大流问题转化为求解网络的最小费用最大流问题,并给出了求解算法的实例。
This paper aimed at discussing the maximum flow problem on the capacity of the arc with upper and lower bounds,as well as giving an algorithm and a mathematical model associated.In other words,in the situation where the network has upper and lower limits,the maximum flow problem was transferred to minimum cost flow problem.Furthermore,an algorithm used to solve the problem was provided.
出处
《计算机科学》
CSCD
北大核心
2015年第S1期349-350 377,377,共3页
Computer Science
基金
贵州省科学技术厅联合基金项目(黔科合J字LKQS[2013]29号)资助
关键词
网络最大流
容量
模型
算法
Maximum network flow,Capacity,Model,Algorithm
