Title :
A Simple Solution to Maximum Flow at Minimum Cost
Author_Institution :
Dept. of Comput. & Commun., Weifang Univ., Weifang, China
Abstract :
This paper presents a simple approach to work out maximum flows at minimum cost. The algorithm, on which the algorithm depends, is verified strictly. The algorithm can obtain a lot of adjusting paths in every iteration. An example is given to demonstrate the use of the algorithm. The algorithm has the merits to be programmed easily and of good convergence, and many experiments have verified its great practicability and effectiveness. It can help teaching improvement and practice application. It is also worth popularization.
Keywords :
directed graphs; tree searching; adjusting path; depth-first search; labeled digraph; maximum flows at minimum cost; Communication networks; Complexity theory; Computers; Convergence; Education; Materials; Mathematical model;
Conference_Titel :
Information Engineering and Computer Science (ICIECS), 2010 2nd International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-7939-9
Electronic_ISBN :
2156-7379
DOI :
10.1109/ICIECS.2010.5677684