SCIP [login to view URL] is an open source software for linear programming with integer variables. I would like to introduce modifications to the existing algorithms developed there.
Specifically, the fundamental algorithm that SCIP employs is branch and bound plus some cutting planes.
In this fundamental branch and bound process for a minimization problem, I would like to control what happens when a new incumbent solution is obtained before a new value of upper bound is recorded globally. Ideally, I want to be able to overwrite the value of the incumbent solution using another function.
I would like to obtain:
-- An analysis of the existing source code, showing where in the code and how the new incumbent solution updates the value of the upper bound of a minimization problem
-- An instruction on how I can overwrite the value of the objective function of the incumbent solution using another function