%0 Journal Article %A XIE Min %A GAO Li-xin %A GUAN Hai-wa %T Ant algorithm applied in maximum-flow problem of networks %D 2008 %R 10.3778/j.issn.1002-8331.2008.22.034 %J Computer Engineering and Applications %P 113-115 %V 44 %N 22 %X The maximum-flow problem of networks is a classical combinational optimization problem,which is an important element of computer science and operations research.Based on the characteristic of ant algorithm,transform the maximum-flow problem of networks correspondingly,and using the ant algorithm to solve.Simulation results show that the algorithm,which can efficiently solve maximum-flow problem of networks in a relatively short time,is effective. %U http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2008.22.034