All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
branch_fullstrong.h File Reference Detailed Descriptionfull strong LP branching rule 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
Definition in file branch_fullstrong.h. #include "scip/scip.h" Go to the source code of this file.
Function Documentation
creates the full strong LP branching rule and includes it in SCIP
Selects a variable from a set of candidates by strong branching
|