Question: Let S = {a, b, c, d, e, f, g} be a collection of objects with benefit-weight values, a: (12, 4), b : (10, 6),
Let S = {a, b, c, d, e, f, g} be a collection of objects with benefit-weight values, a: (12, 4), b : (10, 6), c : (8, 5), d: (11, 7), e: (14, 3), f : (7, 1), g : (9, 6). What is an optimal solution to the 0-1 knapsack problem for S assuming we have a sack that can hold objects with total weight 18? Show your work.
Step by Step Solution
3.42 Rating (158 Votes )
There are 3 Steps involved in it
Let us consider that the capacity of the knapsack is W 18 Wei... View full answer
Get step-by-step solutions from verified subject matter experts
