Question: Knapsack problem. Consider the instance of knapsack problem given by the following data. Assume the knapsack capacity is 1 0 . Item Weight Value 1

Knapsack problem. Consider the instance of knapsack problem given by the following data. Assume the knapsack capacity is 10.
Item Weight Value
1420
2316
3518
428
(10 points) Apply the dynamic programming algorithm to find the optimal solution.
(10 points) Apply the greedy algorithm to find an approximate solution. what is the accuracy ratio?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Finance Questions!

Q:

What are memory functions? Explain how they are used to solve the knapsack problem. Solve the instance of the knapsack problem below. Capacity W= 5 Item # 1 2 3 4 Weight (kg) 2 3 4 5 Value (Rs.) 3 4...

Q:

4. (10 pts.) Greedy choice Recall that in the 0-1 knapsack problem, you are given a backpack with capacity W. There are n items and the i-th item has weight w; and value vi. The goal is to pick some...

Q:

Question 3 ( 2 0 marks ) There are n items and a "knapsack". Each item i has weight w i > 0 and has value v i 0 . Knapsack has capacity of W ? . The goal is to fill knapsack so as to maximize total...

Q:

Recall the knapsack problem ( sometimes called the 0 - 1 knapsack problem ) : you are given n items, where the ith item has weight wi and value vi ( both non - negative integers ) , and a non -...

Q:

orkshe Greedy Algorithm 1. 0-1 arid Cortinueus Knapsack Problem: Consider the 0-1 knapsack problem. Consider the following three strategies. State whether any of . these strategies provide correct...

Q:

4. (10 pts.) Greedy choice Recall that in the 0-1 knapsack problem, you are given a backpack with capacity W. There are n items and the i-th item has weight w; and value vi. The goal is to pick some...

Q:

4. (10 pts.) Greedy choice Recall that in the 0-1 knapsack problem, you are given a backpack with capacity W. There are n items and the i-th item has weight w; and value vi. The goal is to pick some...

Q:

4. (10 pts.) Greedy choice Recall that in the 0-1 knapsack problem, you are given a backpack with capacity W. There are n items and the i-th item has weight w; and value vi. The goal is to pick some...

Q:

Knapsack problem. Question 2 [10 marks]: Consider the instance of discrete knapsack problem with the knapsack capacity 40 and the item information as follows: Item A B D Weight 30 20 20 8 Value $1800...

Q:

Consider the following instance of 0-1 Knapsack problem: Item Profit Weight 11 9 5 6 7 14 5 5 15 9 8 The maximum weight of 16 Kg is allowed in the knapsack. The assumption is that each time an item...

Q:

An electric turntable 0.750 m in diameter is rotating about a fixed axis with an initial angular velocity of 0.250 rev/s and a constant angular acceleration of 0.900 rev/s2, (a) Compute the angular...

Q:

What is throughput? How is it calculated?

Q:

Malik purchased $ 2 0 0 , 0 0 0 of coverage on his $ 4 2 5 , 0 0 0 home in an effort to cut costs. An electrical fire eaused $ 6 0 , 0 0 0 in damages to his home. His insurance company would not pay...

Q:

2.Continental Illinois had a lower operation costs because they had fewer branches and heavily relied on the wholesale funding. 3. In Risk adjusted Return on Capital (RAROC) calculation, we use...