一种最小费用最大流的简单算法  

A Simple Algorithm of Mincost-maxflow

作　　者：徐翠霞[1] 

机构地区：[1]潍坊学院,山东潍坊261061

出　　处：《潍坊学院学报》2009年第4期37-39,共3页Journal of Weifang University

摘　　要：最小费用最大流问题在实际工作中经常会遇到,但传统的求解方法过于繁锁。本文提出的算法,可以在最大流多解算法的基础上,通过简单的动态调整得到一个最小费用最大流。The question of mincost-maxflow often occurs in actual work,but the traditional method is too complicated.In this paper a solve way about mincost-maxflow has been introduced.The question can be solved by dynamic adjusting method basing on optimized maxflow.It can solve these questions easy.There is an excellence in this algorithm,that is,the algorithm not only solves the question of the maximum flow with solutions more than one,but also solves the question of the mincost-maxflow.

关 键 词：最小费用最大流 有向流网络 调整 深度优先搜索 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]