We currently have to set the lower bound in our callback:
tree.lb = min(minimum([prio[2][1] for prio in tree.node_queue]), tree.incumbent)
Otherwise tree.lb and tree.incumbent are not the same in the last iteration.
The lower bound should be updated in the optimize! loop directly.
We currently have to set the lower bound in our callback:
tree.lb = min(minimum([prio[2][1] for prio in tree.node_queue]), tree.incumbent)Otherwise
tree.lbandtree.incumbentare not the same in the last iteration.The lower bound should be updated in the
optimize!loop directly.