Question: Consider a modified 0-1 knapsack problem, in which we are given n different types of objects. For each object of type i, w[i] and b[i]

Consider a modified 0-1 knapsack problem, in which we are given n different types of objects. For each object of type i, w[i] and b[i] are its weight and profit respectively, and there are arbitrary number of objects for each type. The knapsack limit is W. Design a dynamic programming algorithm to output the total profit of the subset of objects with the maximum total profit and with the total weight not greater than W. What is the time complexity of your algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
