计算机技术与发展Issue(1)：130-132,3.DOI:10.3969/j.issn.1673-629X.2014.01.033
最小费用最大流问题的一种新算法
A New Algorithm for Problem of Minimum Cost Maximum Flow
摘要
Abstract
The existing algorithm for minimum cost maximum flow has its defect,improper selection of augmented chain will bring incon-venience in calculation,also the cost cannot reach the ideal effect. In view of the exploration of selecting the augmented chain and making the cost minimum,in this paper,a new algorithm for the minimum cost maximum flow is given by the definition of cost difference. The new algorithm principle is that the minimum cost difference of the directed path is preferred to augment,when the cost difference at the same time,the revised path was chosen. Through the improvement of the minimum cost maximum flow algorithm,the new algorithm is easy to understand and convenient to calculate. A practical example shows the validity and efficiency of the new algorithm.关键词
最小费用最大流/费用差/费用和/增广Key words
minimum cost maximum flow/cost difference/cost and/augmentation分类
信息技术与安全科学引用本文复制引用
赵礼峰,陶晓莉..最小费用最大流问题的一种新算法[J].计算机技术与发展,2014,(1):130-132,3.基金项目
国家自然科学基金资助项目(GZ210039) （GZ210039）
