In the 0-1 Knapsack Problem, if an item's weight is greater than the remaining capacity of the knapsack, what action is typically taken?
Ignore the item and move to the next one
Remove the least valuable item from the knapsack to make space
Add the fractional part of the item that can fit into the knapsack
Remove the most valuable item from the knapsack to make space
This question is part of this quiz :
Dynamic Programming Quiz