Chapter 21 Flashcards
1
Q
What is knapsack problem
A
The knapsack problem belongs to the domain of optimization problems. Thief and jewellery example. We use DP problem to resolve.
2
Q
What is “0-1” problem
A
Each item must be entirely accepted or rejected
