Several Research And Analysis Base On Min-cost Max-flow Algorithm

The minimum cost and maximum flow as a part of network flow problem that mainly studiesnetwork optimization ,it has important meanings in engineering,econo-mic,science and so on. Itincludes the most short circuit the maximum flow and the minimum cost .As the development ofdelivering and transportation ,especially the wildly application of computer. People go deep into itand come up with a series of relevant algorithms ,establishing perfect theory that contribute forhuman society.The key of this paper is on the basis of an oil transportation model to research two algorithms,the maximum flow algorithms and minimum cost algorithms,analyze and compare the associatedpoints, then combination the two algorithms leads to the minimum cost maximum flow problem andfurther extend to explore its practical application,thus continuously improve the theoreticalknowledge of the minimum cost maximum flow problem.This paper firstly introduces the main algorithms : the minimum cost and maximum flow. Weanalyze the characteristic and existing limitations of the algorithm .Combing the minimum cost andmaximum flow and bringing into computer technology. This paper puts forward a new algorithm toresolve the minimum cost and proof the correctness . Secondly, this paper introduces how to realizethis algorithms and gets rid of the limitation that only resolve the small network, giving the best oiltransportation . In the end ,this paper gives the application of The minimum cost and maximumflow in the network coding .