摘要
本文就最大可行流问题给出了一种回溯求解的算法,并证明了不可扩展结点的可剪裁性问题,旨在减少后续可能的搜索空间.在一定程度上可以减少求解过程中的时间消耗.
This paper provides an algorithm about the maximum feasible flow problem with retrospective method. and proves the feasibility to cut some node, which can not extend node during searching for augmenting path. so that it would not need search those nodes during later search, therefore, it cut down the consume of time. in some extent.
出处
《电脑知识与技术》
2006年第12期96-97,共2页
Computer Knowledge and Technology
关键词
最大流
可行流
增值链
Maximum flow
feasible flow
augmenting path
