0_1 knapsack problem, backtracking the backpacking problem 0-l knapsack problem is a subset selection problem. In general, the 0-1 knapsack problem is NP hard. 0-1 knapsack The solution space for the problem can be represented by a subset of trees. Unpack the backtracking of 0-1 knapsack problem and the backtracking method of loading problem Be like. When searching for a solution space tree, the search goes into its left child tree as long as the left child node is a viable node. when The right subtree is likely to contain the optimal solution before entering the right subtree search. Otherwise, cut the right subtree. Let's say r is the current surplus The total value of the goods; Cp is the current value; Bestp is the current optimal value. When cp+r is less than or equal to bestp, it can be cut to the right The subtree. The better way to compute the upper bound of the solution in the right subtree is to sort the remaining items in terms of the weight of their units, and then Load the item in turn until it is loaded

beibao.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．