0
$\begingroup$

I'm trying to implement a recursive algorithm that I came up with that first solves the knapsack for a given objective and then cuts off the solution and then finds the next best solution. However, I have some dependencies among the items in the knapsack which basically group certain items into one big item. I can either choose all or them, or none of them. Is there a way to model this without using additional variables apart from the n indicator ones representing the ones in the knapsack?

Improve this question
$\endgroup$
2
  • $\begingroup$ What do you mean by "cuts off the solution"? $\endgroup$
    – user5810
    Aug 1, 2011 at 22:35
  • 2
    $\begingroup$ Why not aggregating and have just one variable per "big item"? $\endgroup$
    – Thomas Kalinowski
    Aug 1, 2011 at 23:08

0

Reset to default

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.