Register

self doubt *0/1 knapsack problem*

724 views
0 votes
0 votes
In 0/1 knapsack problem ,suppose if maximum weight is given as W and we are asked to find out max profit then * IS IT NECESSARY THAT THE TOTAL WEIGHT SHOULD BE EXACTLY EQUAL TO  W  OR IT CAN BE LESS THAN W AS WELL????
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2.9k
views
1 answers
0 votes
Syedabbas110 asked Oct 30, 2017
2,887 views
Knapsack problem
5.Consider the Knapsack instance with 5 objects and a capacity M=11, profit P=(5,4,7,2,3) andweight W=(4,3,6,2,2.). Solve it using dynamic programming approach.
User Avatar
2.7k
views
1 answers
1 votes
LavTheRawkstar asked Mar 25, 2017
2,713 views
#Confusion Is it necessary to arrange the weights in Ascending order while solving 0/1 Knapsack problem using Dynamic
Number of Cateogires are 5, Thier total weights are w1,w2,w3,w4,w5={7,2,4,8,6}b1,b2,b3,b4,b5={5,6,4,3,2}M=6=Maximum Capacity= WI am having ... Dynamic Knapsack problemDo we firstly need to arrande the weights in increasing order ??????????
User Avatar
4.8k
views
2 answers
7 votes
vaishali jhalani asked Nov 6, 2016
4,838 views
0/1 knapsack
The difference between maximum possible profit for $0/1$ Knapsack and fractional Knapsack problem with capacity $(W)=20$ ... knapsack, we have to make the whole table or there is any direct method to this?
User Avatar
1.1k
views
0 answers
0 votes
VIKAS TIWARI asked Dec 13, 2017
1,120 views
General Topic Doubt: Algorithms - Dynamic Programming
Read the following statements about 0/1 Knapsack problem.(i) Time complexity of Knapsack is O(n* W) where W is the weight of the Knapsack and there are n items.(ii) Time complexity ... true (i) ( iii) (iv) is true (ii) (iii) (iv) is true.
User Avatar
Link Copied!