Ask
Login
0
5.6kviews
Explain 0/1 knapsack problem using dynamic programming.
written 9.4 years ago by gravatar for teamques10 teamques10 ★ 70k •   modified 5.7 years ago
analysis of algorithms
ADD COMMENT EDIT
1 Answer
1
60views
written 9.4 years ago by gravatar for teamques10 teamques10 ★ 70k
  1. We are given n objects and a knapsack. Each object I has a positive weight w, and a positive weight w, and a positive profit p. The knapsack can carry a weight not exceeding m.
  2. Our aim is to fill the knapsack in such a way so that the sum …

Create a free account to keep reading this post.

and 3 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.