Introduction - If you have any usage issues, please Google them yourself
Given n items and a knapsack. The weight of the item I is wi, the volume is Bi, its value is VI, the capacity of the knapsack is C, the volume is d. How do you choose to choose the items in the backpack to make the most of the total value of the items in the backpack? When choosing a backpack, there are only two options for each item I, that is, to be loaded into a backpack or not to be loaded into a backpack. You can't load an item I into a backpack many times, and you can't just load a part of the item I. A dynamic programming algorithm for solving this problem is designed and the computational complexity of the algorithm is analyzed.