SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
|
branch_leastinf.h File Reference Detailed Descriptionleast infeasible LP branching rule The least infeasible branching rule selects a candidate variable $j$ with fractional solution value
i. e., a variable which already is closest to being integral among all branching candidates. The least infeasible rule and many other branching rules of SCIP are explained and compared in
Definition in file branch_leastinf.h. #include "scip/scip.h"Go to the source code of this file.
Function Documentation
creates the least infeasible LP branching rule and includes it in SCIP
|
|||||||||||||||
which maximizes ![\[ \max \left\{ \lceil \hat{x}_j \rceil - \hat{x}_j, \hat{x}_j - \lfloor \hat{x}_j \rfloor \right\}. \]](form_70.png)