Solving Constraint Integer Programs

branch_mostinf.h File Reference

Detailed Description

most infeasible LP branching rule

Tobias Achterberg

The most infeasible branching rule selects a candidate variable $j$ with fractional solution value \( \hat{x}_j\) which maximizes

\[ \min \left\{ \lceil \hat{x}_j \rceil - \hat{x}_j, \hat{x}_j - \lfloor \hat{x}_j \rfloor \right\}. \]

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

Tobias Achterberg
Constraint Integer Programming
PhD Thesis, Technische Universit├Ąt Berlin, 2007

Definition in file branch_mostinf.h.

#include "scip/def.h"
#include "scip/type_retcode.h"
#include "scip/type_scip.h"

Go to the source code of this file.


SCIP_RETCODE SCIPincludeBranchruleMostinf (SCIP *scip)