Scippy

    SCIP

    Solving Constraint Integer Programs

    Functions
    branch_fullstrong.h File Reference
    Public API of SCIP » Plugin API of SCIP » Branching Rules

    Detailed Description

    full strong LP branching rule

    Author
    Tobias Achterberg

    The full strong branching rule applies strong branching to every fractional variable of the LP solution at the current node of the branch-and-bound search. The rule selects the candidate which will cause the highest gain of the dual bound in the created sub-tree among all branching variables.

    For calculating the gain, a look-ahead is performed by solving the child node LPs which will result from branching on a variable.

    For a more mathematical description and a comparison between the strong branching rule and other branching rules in SCIP, we refer to

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

    Definition in file branch_fullstrong.h.

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

    Go to the source code of this file.

    Functions

    SCIP_RETCODE SCIPincludeBranchruleFullstrong (SCIP *scip)
     
    SCIP_RETCODE SCIPselectVarStrongBranching (SCIP *scip, SCIP_VAR **lpcands, SCIP_Real *lpcandssol, SCIP_Real *lpcandsfrac, SCIP_Bool *skipdown, SCIP_Bool *skipup, int nlpcands, int npriolpcands, int ncomplete, int *start, int maxproprounds, SCIP_Bool probingbounds, SCIP_Bool forcestrongbranch, int *bestcand, SCIP_Real *bestdown, SCIP_Real *bestup, SCIP_Real *bestscore, SCIP_Bool *bestdownvalid, SCIP_Bool *bestupvalid, SCIP_Real *provedbound, SCIP_RESULT *result)