Skip to main content

Dynamic MIP Search Method

Awaiting user input


1 comment

  • Jaromił Najman
    Gurobi Staff Gurobi Staff

    Hi Artur,

    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.

    Could you elaborate a bit more on what exactly you are doing? Are you adding lazy constraints / user cuts in a callback? Is it a performance issue? If it is a performance issue and you are not adding lazy constraints /user cuts you could share your model and maybe we can find something to improve the performance.

    How can I disable this feature and use the traditional branch-and-cut?

    Unfortunately, there is currently no parameter to turn off the more-or-less equivalent of CPLEX' "dynamic search" and there is no parameter to run a "vanilla" B&B algorithm. You could try to turn off Cuts and experiment with the MIPFocus parameter to lead the solver in a particular direction.

    Best regards, 


Please sign in to leave a comment.