中文摘要：

常见的两种最小费用最大流算法是在最小费用基础上通过增广链求得最大流量和在最大流量基础上通过可调圈求得最小费用。通过对两种算法进行综合比较,分析其优缺点及改进思路,提出新的算法：利用最小费用法寻找最小费用增广链,据此求得接近最小费用的最大流;再通过可调圈法检验并调整该结果。

英文摘要：

Two common algorithms of Mincost- maxflow are calculating the maximum flow based on the minimum cost by augmenting chain and calculating the minimum cost based on the maximum flow by adjusting circle. In this paper a new algorithm has been introduced on the condition of the comprehensive comparison of these algorithms and the analysis of their advantages and disadvantages and improvement ideas. The new algorithm calculates the maximum flow which value is close to the minimum cost＇s by finding the minimum cost augmenting chain using the minimizing cost algorithm,then tests and adjusts the results by adjusting circle.