search
Log In
0 votes
833 views
Consider the following instance of the knapsack problem: n=3 , W=50 , (v1,v2,v3) = (60,100,120) and weight (w1,w2,w3) = (10,20,30) .

solve the given knapsack problem applying greedy algorithm.
in Algorithms
edited by
833 views

1 Answer

3 votes
 
Best answer

hope it helps...


selected by

Related questions

6 votes
2 answers
1
0 votes
1 answer
2
895 views
The following Knapsack bag. The Knapsack bag maximum Capacity is 50. Find out the maximum profit for Fractional Knapsack. 90 80.25 85.50 91.2
asked Nov 17, 2017 in Algorithms Parshu gate 895 views
1 vote
1 answer
3
1.1k views
Item Total Weight Total Profit 1 2 10 2 3 5 3 5 15 4 7 7 5 1 6 6 4 18 7 1 3 Answer is 55.33 but how?
asked Feb 28, 2017 in Algorithms LavTheRawkstar 1.1k views
4 votes
0 answers
4
7.4k views
The difference between maximum possible profit for 0/1 Knapsack and fractional Knapsack problem with capacity (W) = 20. Solution Given: I know how to do both the greedy and Dynamic programming. But i know only tabulation method,the solution above given shows some easy way to do it. don't know what shortcuts they used above. please suggest is there any easy way to other than tabulation method ?
asked Jan 9, 2016 in Algorithms Prasanna 7.4k views
...