计算机技术与发展2012，Vol.22Issue(5)：94-96,3.
求解最小费用最大流的新方法
Labeling Algorithm to Solve Maximum Network Flow Problem
摘要
Abstract
It gives a new method of solving network minimum cost maximum flow. Finding me chain from the starting point to the ending point and find the maximum capacity that the chain can pass by. According to the maximum capacity .calculate the network minimum cost and unit cost through maximum capacity and minimum cost. Choose the smallest chain of unit cost to augment with the biggest capacity. By improving the shortest path algorithm,make the algorithm understand easier and avoid to augment by residual network and enhance the efficiency of solving the minimum cost and the maximum flow. It manifests the practice of algorithm through example and speci6c algorithm steps.关键词
最小费用最大流/最大容量/单位费用/剩余网络Key words
minimum cost maximum flow/maximum capacity/unit cost/residual network分类
信息技术与安全科学引用本文复制引用
赵礼峰,白睿,宋常城..求解最小费用最大流的新方法[J].计算机技术与发展,2012,22(5):94-96,3.基金项目
国家自然科学基金项目(61070234,61071167) （61070234,61071167）
