华南理工大学数据结构与算法课件Chapter15 Branch and Bound Method.pptVIP

* * Chapter 15 Branch and Bound Method 15.1 Algorithm Idea 15.2 Application 15.2.1 Shipping Containers 15.2.2 0-1 Knapsack Problem 15.2.3 the Largest Complete Sub-graph Branch and bound method is similar to backtracking described above, they get the solution of problem in their solution space, but the difference is, branch and bound method commonly used breadth-first or least-cost way to search the tree structure of the solution space. This chapter uses the same example of Chapter 14 for discussion, in order to compare the similarities and differences of branch and bound and backtracking mo