I'm have implemented a branch-and-cut algorithm using Gurobi, but in order to improve its performance, I want to detect when no significant changes happens during the (LP<->separation) loop, and force it to branch instead of trying to add more cutting planes. I guess this is called "early branching", but I'm not sure...
Currently I'm trying to compare the LP value obtained in the previous iteration of the loop and compare. But sometimes, strange things happens. My problem is a maximization one, but sometimes, after adding a cutting plane, the LP value gets higher! Nevertheless, the Branch-and-Cut seems to be ok, since it always find an optimal solution in all my instances.
Please sign in to leave a comment.