Dear community team,
I have tried to solve a special knapsack problem which contains an inequality with binary parameters.
AFAIK, cover cuts families can be applied to solve the standard knapsack problem efficiently but, in the above case, just Gomory cuts families have been applied. I was wondering, would you know any reasons?
Please sign in to leave a comment.