Take 0-1 knapsack problem for example,in contrast to static state space tree algorithm,the new algorithm spends less times and it helps to extend the application of backtracking algorithm.
英
美
- 以0-1背包問(wèn)題為例,說(shuō)明動(dòng)態(tài)樹(shù)方法對求解線(xiàn)性規劃問(wèn)題等是非常有用的,且該算法所用時(shí)間少于靜態(tài)狀態(tài)空間樹(shù)方法,有助于擴大回溯算法的應用。
