Special knapsack problem

回答済み

A.Omidi

2019年10月13日 12:09

• 
• 
• 

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?

0

• 正式なコメント

  

  Simranjit Kaur

  • Gurobi Staff

  2025年06月23日 03:22 編集済み

  This post is more than three years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum. Or why not try our AI Gurobot?.
• 

  Silke Horn

  • Gurobi Staff

  2019年10月16日 10:15

  The solver tries to apply all kinds of cuts when solving a model and chooses automatically how aggressively each kind of cut is applied. In the final overview, you only see the ones that were not dominated by some other cuts.

  However, you can influce this behavior by parameter settings. E.g. you could experiment with setting CoverCuts to a higher value. (It is usually very difficult to beat the default settings here, but sometimes you do get some performance improvements.)

  Silke

  0
• 

  A.Omidi

  2019年10月16日 12:47

  • 
  • 
  • 

  Many thanks for your detailed explanations.

  Regards

  0

投稿コメントは受け付けていません。