World's most popular travel blog for travel bloggers.

[Solved]: Unlimited Knapsack Problem

, , No Comments
Problem Detail: 

How would I solve the unbounded knapsack problem, only this time aiming to maximize the weight instead of the value?

Asked By : user1563544

Answered By : emab

One simple way is to consider the value of each pack as $cost(object)=weight(object)$ (Now every object has a uniform value) and solve the same knapsack problem. The other way is to consider a variation of packing problems link

Best Answer from StackOverflow

Question Source :

3.2K people like this

 Download Related Notes/Documents


Post a Comment

Let us know your responses and feedback