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.

程序
....\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．