华南理工大学数据结构与算法课件Chapter14 Backtracking.pptVIP

* * Chapter 14 Backtracking 14.1 Algorithm Idea 14.2 Application 14.2.1 Container Shipping 14.2.2 0-1 Knapsack Problem 14.2.3 The Largest Complete Sub-graph A reliable problem solving methods is a candidate solution to all its checks one by one in order to obtain the required solution. But when a problem is very large number of candidate solutions (such as the index level), the above method is not applicable, because even with the fastest computer can only solve very small problems. System checks on the candidate solutions There are several ways in which backtracking and branch and bound me