Which of the following scenarios would cause the greedy approach (rational knapsack algorithm, choosing items by highest value-to-weight ratio) to fail in solving the 0/1 (or binary) knapsack optimally?

Question

Answer

Items have fractional weights

Answer

None of these

Answer

All items have the same value and weight

Answer

All item values are zero

Answer

Knapsack capacity is very large

Answer

The item with the best value/weight ratio cannot be combined with others due to its weight

Crowdly

Which of the following scenarios would cause the greedy approach (rational knaps...

Want instant access to all verified answers on moodle.nu.edu.kz?