branch_leastinf.h File Reference
Detailed Description
least infeasible LP branching rule
The least infeasible branching rule selects a candidate variable $j$ with fractional solution value \( \hat{x}_j\) which maximizes
\[ \max \left\{ \lceil \hat{x}_j \rceil - \hat{x}_j, \hat{x}_j - \lfloor \hat{x}_j \rfloor \right\}. \]
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
- Tobias Achterberg
Constraint Integer Programming
PhD Thesis, Technische Universität Berlin, 2007
Definition in file branch_leastinf.h.
Go to the source code of this file.
Functions | |
SCIP_RETCODE | SCIPincludeBranchruleLeastinf (SCIP *scip) |