1) Given a knapsack with the capacity M and some items with its weight and profit, to solve it using Greedy method and Search tree method. 2) Then compare this results with ones of 0/1 Knapsack problem based on the capacity of M. 3) These items could be given likes: • M = 30 • (P1, P2, P3, P4, P5, P6)=(25,24,15,18,22,35) • (W1, W2, W3, W4, W5, W6) = (12, 15, 10, 8, 9, 11) 4) These items could constructed by the random() function in some range, such as: (Wmin, Wmax) and (Pmin, Pmax) and the number of item could be more.

周宇梁 201430571102.doc
lab2.cpp

• 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．