branch_allfullstrong.h File Reference Detailed Descriptionall variables full strong LP branching rule The all variables full strong branching rule applies strong branching to every non-fixed variable 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
Definition in file branch_allfullstrong.h. #include "scip/scip.h" Go to the source code of this file.
Function Documentation
Selects a variable from a set of candidates by strong branching
creates the all variables full strong LP branching rule and includes it in SCIP
|