next up previous contents index
Next: Pool without Constraint Duplication Up: New Features Previous: Problem Specific Branching

Generalized Strong Branching

 

Generalized strong branching is the possibility of evaluating different branching rules and selecting the best ones. If branching on variables is performed, e.g., the first linear programs of the (potential) sons for various branching variables are solved, in order to find the most promising variable. Together with the built-in branching strategies this feature can be controlled with the new entry NBranchingVariableCandidates  of the configuration file (Section gif). Moreover, also other branching strategies can be evaluated as explained in Section gif.



Stefan Thienel
Fri Sep 19 11:32:54 MET DST 1997