SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
|
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
branch_mostinf.h File Reference Detailed Descriptionmost infeasible LP branching rule The most infeasible branching rule selects a candidate variable $j$ with fractional solution value
i. e., a variable which still is farthest from taking an integer value among all branching candidates. The most infeasible branching rule and many other branching rules of SCIP are explained and compared in
Definition in file branch_mostinf.h. #include "scip/scip.h"Go to the source code of this file.
Function Documentation
creates the most infeasible LP branching rule and includes it in SCIP
|
|||||||||||||||
which maximizes ![\[ \min \left\{ \lceil \hat{x}_j \rceil - \hat{x}_j, \hat{x}_j - \lfloor \hat{x}_j \rfloor \right\}. \]](form_43.png)