All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
branch_mostinf.h
Go to the documentation of this file.
21 * The most infeasible branching rule selects a candidate variable $j$ with fractional solution value \f$ \hat{x}_j\f$
24 * \min \left\{ \lceil \hat{x}_j \rceil - \hat{x}_j, \hat{x}_j - \lfloor \hat{x}_j \rfloor \right\}.
26 * i. e., a variable which still is farthest from taking an integer value among all branching candidates.
28 * The most infeasible branching rule and many other branching rules of SCIP are explained and compared in
|