0/1 knapsack problem, the need for the capacity of the c loaded backpack. N items from the selected load backpack items, each of the items i weight of wi, the value of pi. For a viable backpack loaded backpack with a total weight of the backpack should not exceed capacity, loading is the best means by loading the maximum value of goods that sigma pi* xi obtain maximum.

Packet : 75448184背包问题程序.rar filelist
程序
程序\Project1.cfg
程序\Project1.dof
程序\Project1.dpr
程序\Project1.exe
程序\Project1.res
程序\Project1.~dpr
程序\Unit1.dcu
程序\Unit1.ddp
程序\Unit1.dfm
程序\Unit1.pas
程序\Unit1.~ddp
程序\Unit1.~dfm
程序\Unit1.~pas

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