Write a program for knapsack problem

4.6kviews

written 7.9 years ago by

satishmanje93 • 250

modified 3.7 years ago by

teamques10 ★ 70k

Consider the following instance of knapsack problem:

No. of objects n=3, knapsack capacity m=20 profit (p1,p2,p3)= (25, 24, 15) and weight (w1, w2,w3)=(18, 15, 10)

analysis of algorithms

ADD COMMENT EDIT

1 Answer

13views

written 3.9 years ago by

Krishna_Agrawal • 2.7k

Given,

weights = {18, 15, 10}

values = {25, 24, 15}

weight(w) = 20

Here, the weight of the knapsack is 20. So, we can only put any 1 item in the knapsack.

On putting, 1st item - value will be 25 and weight will be 18.

On putting, 1st …

Create a free account to keep reading this post.

and 2 others joined a min ago.

ADD COMMENT EDIT

Please log in to add an answer.