Skip to main content

Adding multiple cuts in a single node (branch-and-cut algorithm)



1 comment

  • Daniel Espinoza

    Hi Jounsoo,

    As you already said, there is no way for a user to control how many rounds of cuts in a node the solver will perform, nor to force which cuts to add, as the solver might decide not to add all cuts, or even to skip cuts for some nodes of the B&B tree. If your interest is on research, I would recommend using something like SCIP, or CBC, where you have access to the full code and can control in great detail what you can do in each step.

    Sorry for not being able to give you more options.



Please sign in to leave a comment.