through research paper on dynamic programming, According to the principle of resolving the 0/1 knapsack problem with the algorithm, the algorithm was verified the correctness. Observation running findings, based on dynamic programming algorithm can be the correct decision than a program exhaustive method effective.

解01背包问题的动态规划算法.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．