摘要
本文分析了深度优先搜索方法 (DFS)和广度优先搜索 (BFS)方法的特点 ,提出了一种混合使用动态规划方法和下界 (上界 )算法的精确求解方法求解组合优化问题。实验结果表明 ,下界 (上界 )非常接近问题的最优值时 。
A hybrid algorithm combined with dynamic programming and the lower bound (or upper bound) algorithm is proposed. It is on the basis of analysing the depth first search (DFS) and the breadth first search (BFS) methods. Experiments show that this hybrid algorithm is valid when lower bound or upper bound is very close to the optimum of the problem.
出处
《计算机工程与科学》
CSCD
2004年第12期64-66,70,共4页
Computer Engineering & Science
