SCIP
Solving Constraint Integer Programs
Solving Constraint Integer Programs
|
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Groups Pages
branch_pscost.h File Reference Detailed Descriptionpseudo costs branching rule The pseudo costs branching rule selects the branching variable with respect to the so-called pseudo costs of the variables. Pseudo costs measure the average gain per unit in the objective function when the variable was branched on upwards or downwards, resp. The required information is updated at every node of the solving process. The selected variable maximizes the expected gain of the dual bound in the created subtree. For a more mathematical description and a comparison between the pseudo costs branching rule and other branching rules in SCIP, we refer to
Definition in file branch_pscost.h. #include "scip/scip.h"Go to the source code of this file.
Function Documentation
creates the pseudo cost branching rule and includes it in SCIP
selects a branching variable, due to pseudo cost, from the given candidate array and returns this variable together with a branching point
|
|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
