MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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?

share|cite|improve this question
What do you mean by "cuts off the solution"? – Ricky Demer Aug 1 '11 at 22:35
Why not aggregating and have just one variable per "big item"? – Thomas Kalinowski Aug 1 '11 at 23:08

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.