SBSELECT

The size of the candidate list of global entities for strong branching.

Integer

-2	Automatic (low effort).
-1	Automatic (high effort).
n>=0	Include n entities in the candidate list (but always at least SBBEST candidates).

-2

Before strong branching is applied on a node of the branch and bound tree, a list of candidates is selected among the infeasible global entities. These entities are then evaluated based on the local LP solution and prioritized. Strong branching will then be applied to the SBBEST candidates. The evaluation is potentially expensive and for some problems it might improve performance if the size of the candidate list is reduced.

XPRSmipoptimize ( MIPOPTIMIZE).

SBBEST, SBEFFORT, SBESTIMATE.