摘要
文中给出了一种求解网络最小费用最大流的新方法,寻找由始点到终点的每条有向链,找到有向链可通过的最大容量,根据最大容量计算出此条有向链的最小费用最大流,根据最大容量和最小费用最大流可以计算出单位费用。选取单位费用最小的有向链进行最大容量的增广。文中通过对最小费用路算法进行改进,使得该算法容易理解,却又避免了最小费用路算法每次都要经过剩余网络进行增广,从而大大提高了求解最小费用最大流执行的效率。该算法通过实例给出了具体算法步骤并且表明了算法的实用性。
It gives a new method of solving network minimum cost maximum flow. Finding the 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 specific algorithm steps.
出处
《计算机技术与发展》
2012年第5期94-96,共3页
Computer Technology and Development
基金
国家自然科学基金项目(61070234
61071167)
关键词
最小费用最大流
最大容量
单位费用
剩余网络
minimum Cost maximum flow
maximum capacity
unit cost
residual network
