The integer optimization solver control parameter object
>>> r = IntOptControls()
Whether to binarize integer variables, a bool
This option is only used if presolve is True.
The branching technique, a str
The possible values are
The backtracking technique, a str
The possible values are
Callback routine
Transit pointer passed to the routine cb_func
Number of extra bytes allocated for each search tree node, an int
Up to 256 bytes can be allocated for each node of the branch-and-bound tree to store application-specific data. On creating a node these bytes are initialized by binary zeros.
>>> r.cb_size # the GLPK default
0
>>> r.cb_size = 128
>>> r.cb_size
128
Whether to apply the feasibility pump heuristic, a bool
The relative MIP-gap tolerance, a Real number
The search stops once the relative MIP-gap falls below this value.
The message level, a str
The possible values are
>>> r.msg_lev # the GLPK default
'full'
>>> r.msg_lev = 'no'
>>> r.msg_lev
'no'
The preprocessing technique, a str
The possible values are
Whether to apply the proximity search heuristic, a bool