Using greedy algorithm approach to solve the following fractional knapsack problem: A thief robbing a store finds 3 item
Posted: Fri May 20, 2022 12:26 pm
Using greedy algorithm approach to solve the following
fractional knapsack problem: A thief robbing a store finds 3 items,
each worth $60, $100, and $120 respectively, and each weights 10
pounds, 20 pounds, and 30 pounds respectively. Thief’s
knapsack can carry at most 50 pounds. Please give the value of
maximum profit.
fractional knapsack problem: A thief robbing a store finds 3 items,
each worth $60, $100, and $120 respectively, and each weights 10
pounds, 20 pounds, and 30 pounds respectively. Thief’s
knapsack can carry at most 50 pounds. Please give the value of
maximum profit.