机构地区: 中国科学技术大学计算机科学与技术学院
出 处: 《计算机研究与发展》 2003年第9期1281-1292,共12页
摘 要: 网络最大流问题和它的对偶问题———最小截问题 ,是一对经典组合优化问题 ,它们在许多工程领域和科学领域有重要的应用 ,是计算机科学和运筹学重要的内容 最大流问题已经有 4 0多年的研究历史 ,近年来 ,随着各种网络的飞速发展 ,最大流问题的研究也取得了很大的进展 对最大流问题研究做了详细的总结 。 The maximum flow problem and its dual problem—the minimum cut problem are a pair of classical combinatorial optimization problems, which arise in many engineering and scientific applications They are important parts of computer science and operational research The research on the maximum flow problem has a history of more than 40 years Recently, with the rapid development of various networks, the research on the maximum flow problem has made remarkable achievements Detailed summarization of the research on the problem is made, and the research directions are forecasted