title: Modified knapsack with branch and bound method
body: <p>So the problem I have is the following : there is a set of N categories of objects, in each category there are M objects, each with a specified value and weight. We have to pick one object from each category so that the weight is &lt;= some given capacity W, and the value is maximum. The task has to be solved using the branch and bounds method. I struggle to understand how is this method supposed to work in this situation. Could you please explain it to me?</p>