Question: Consider this instance of the knapsack problem: The weights are: 8 , 6 , 1 4 , 4 , 1 0 , 2 The prices

Consider this instance of the knapsack problem:
The weights are: 8,6,14,4,10,2
The prices are: 60,36,21,18,30,18
The capacity is: M=18.
Find the greedy the solution for this problem, showing the process step by step

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 Programming Questions!

Q:

pass me answer in digital text form, thank you. Q2 Consider the instance of discrete knapsack problem with the knapsack capacity 20 and the item information as follows: Item 1 2 3 4 Weight 15 10 10 4...

Q:

6. (8 points) Greedy Algorithms Consider a version of the Knapsack problem in which every item has the same weight (say the weight is 1). In this case the problem is simpler and we can use a greedy...

Q:

6. (8 points) Greedy Algorithms Consider a version of the Knapsack problem in which every item has the same weight (say the weight is 1). In this case the problem is simpler and we can use a greedy...

Q:

Homework of Knapsack 1 . Consider an instance of the Knapsack Problem without repetitions with 4 items, having weights and values as follows. The weights ( in pounds ) are w 1 = 2 , w 2 = 2 , w 3 = 4...

Q:

bmit one pdf file to answer each question. Q2 Consider the instance of discrete knapsack problem with the knapsack capacity 20 and the item information as follows: on Item 1 2 3 4 Weight 15 10 10 4....

Q:

Consider an instance of the Knapsack Problem without repetitions with 4 items, having weights and values as follows. The weights ( in pounds ) are w 1 = 2 , w 2 = 2 , w 3 = 4 , w 4 = 5 . The dollar...

Q:

Consider the instance of discrete knapsack problem with the knapsack capacity 20 and the item information as follows: Item 1 2 3 4 Weight 15 10 10 4 Value $900 $580 $580 $180 Find the most valuable...

Q:

Question 1 [12 marks]: Consider the instance of discrete knapsack problem with the knapsack capacity 10 and the item information as follows: Item Weight Value 4 $1200 2 3 $6000 3 w $5100 $5400 Find...

Q:

Consider a version of the Knapsack problem in which every item has the same weight (say the weight is 1). In this case the problem is simpler and we can use a greedy algorithm to solve the problem....

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:

Financial Statements Turtle Company has prepared the following adjusted Trial balance for the year ended December 31, 2019: Debit Credit $ 1,700 2,100 1,800 5,400 Cash Accounts Receivable (net)...

Q:

Why should enterprisers focus on goals and values as they prepare to start their new ventures?

Q:

When insurance companies use fear appeals to try to convince customers to boy inour ance, how sary thould tha ads be ? moderately scary, if it's too scary people will ignore it , if its not sary...

Q:

What do leaders need from followers?