-1
$\begingroup$

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

$\endgroup$
0
$\begingroup$

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

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.