Scippy

SCIP

Solving Constraint Integer Programs

Functions
branch_mostinf.h File Reference
Branching Rules

Detailed Description

most infeasible LP branching rule

Author
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/scip.h"

Go to the source code of this file.

Functions

SCIP_RETCODE SCIPincludeBranchruleMostinf (SCIP *scip)
 

Function Documentation

SCIP_RETCODE SCIPincludeBranchruleMostinf ( SCIP *  scip)

creates the most infeasible LP branching rule and includes it in SCIP

Parameters
scipSCIP data structure

Definition at line 356 of file branch_mostinf.c.

References BRANCHRULE_DESC, BRANCHRULE_MAXBOUNDDIST, BRANCHRULE_MAXDEPTH, BRANCHRULE_NAME, BRANCHRULE_PRIORITY, NULL, SCIP_CALL, SCIP_OKAY, SCIPincludeBranchruleBasic(), SCIPsetBranchruleCopy(), SCIPsetBranchruleExecExt(), and SCIPsetBranchruleExecLp().

Referenced by SCIP_DECL_BRANCHCOPY(), and SCIPincludeDefaultPlugins().