Modifying the equations during the B&B or B&C algorithm
Posted: Wed Jul 04, 2018 2:55 pm
Hello,
I would like to know whether it is possible to modify the constraints of a MILP problem at each node of the search tree.
When going through the search tree of a MILP problem, at each node, we introduce some bounds on the integer variables.
These bounds should allow me to refine the parameters of the problem to make the problem tighter.
The problem is that, for common MILP solvers, I cannot find any options that would allow me to update the constraints at each node.
Does someone know how I could do this?
Thank you,
Quentin
I would like to know whether it is possible to modify the constraints of a MILP problem at each node of the search tree.
When going through the search tree of a MILP problem, at each node, we introduce some bounds on the integer variables.
These bounds should allow me to refine the parameters of the problem to make the problem tighter.
The problem is that, for common MILP solvers, I cannot find any options that would allow me to update the constraints at each node.
Does someone know how I could do this?
Thank you,
Quentin