branch_mostinf.h
Go to the documentation of this file.
30 * The most infeasible branching rule selects a candidate variable $j$ with fractional solution value \f$ \hat{x}_j\f$
33 * \min \left\{ \lceil \hat{x}_j \rceil - \hat{x}_j, \hat{x}_j - \lfloor \hat{x}_j \rfloor \right\}.
35 * i. e., a variable which still is farthest from taking an integer value among all branching candidates.
37 * The most infeasible branching rule and many other branching rules of SCIP are explained and compared in
46 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
Definition: struct_scip.h:68
SCIP_RETCODE SCIPincludeBranchruleMostinf(SCIP *scip)
Definition: branch_mostinf.c:371
type definitions for return codes for SCIP methods
type definitions for SCIP's main datastructure
common defines and data types used in all packages of SCIP
Definition: objbenders.h:43