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.
英
美
- 本文分析了深度優(yōu)先搜索方法 (DFS)和廣度優(yōu)先搜索 (BFS)方法的特點(diǎn) ,提出了一種混合使用動(dòng)態(tài)規劃方法和下界 (上界 )算法的精確求解方法求解組合優(yōu)化問(wèn)題。
