I am an old CPLEX user that is trying to move to Gurobi. I have an academic application (the main topic of a paper to be submitted by a doctorate student) where powerful user cuts are added through callbacks. By the messages that it prints in the screen, I realize that Gurobi is trying to apply the MIP search method that is referred to in CPLEX as "dynamic search": the best dual bound value stops progressing and it starts to explore nodes with worse bounds, probably trying to build a new search tree that is more advantageous. However, for this application, it is a time loss because my user cuts are applied only when the gap is large. So, all the accumulated knowledge exploring the whole tree is misleading when processing nodes that are close to the root. How can I disable this feature and use the traditional branch-and-cut? I did not find a parameter for that in Gurobi.
Please sign in to leave a comment.