Ask
Login
0
54kviews
Explain 0/1 Knapsack Problem with example.
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 4.1 years ago
analysis of algorithms
ADD COMMENT EDIT
1 Answer
5
2.0kviews
written 7.8 years ago by gravatar for teamques10 teamques10 ★ 65k •   modified 7.8 years ago
  1. Knapsack problem is also called as rucksack problem.
  2. It is a problem in combinatorial optimization.
  3. Knapsack problem states that: Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.