Originally posted by: lxysjtu
Dear all,
I am developing a B&C to solve a network design problem. In the separation, I need to solve a lot of maximum flow problems to find a violated cut. But this is too time-consuming. So I tried a simpler strategy where I only added cut when an integer solution was found.
With this strategy, the B&C was able to find a good incumbent very quickly. But it may spend a lot of time to verify if this incumbent is optimal.
Attached please find one example of search tree.
My question is that is there any method to prune nodes from the tree.
Thanks,
Shaon
#DecisionOptimization#OPLusingCPLEXOptimizer