Tuning performance features of the mixed integer optimizer

Describes features for tuning performance of the MIP optimizer.

Branch & cut or dynamic search?
Describes the search facilities of the MIP optimizer.
Introducing performance features of the MIP optimizer
Describes performance features generally.
Applying cutoff values
Describes conditions in which CPLEX applies a cutoff value.
Applying tolerance parameters
Describes conditions in which CPLEX applies tolerances.
Applying heuristics
Describes conditions in which CPLEX applies heuristics.
When an integer solution is found: the incumbent
Describes CPLEX handling of an incumbent value.
Controlling strategies: diving and backtracking
Describes parameters to control search strategies
Selecting nodes
Describes options of the parameter to control selection of strategies applied at nodes and their effect on the search.
Selecting variables
Describes trade-offs around variable selection and options of the parameter to control selection of the next variable.
Changing branching direction
Describes options of the parameter to change branching direction and its effect on search.
Solving subproblems
Describes the parameters to control solution of subproblems.
Using node files
Describes a storage feature for nodes of the search.
Probing
Describes probing, a technique that fixes binary variables and analyzes the implications.

Parent topic: Solving mixed integer programming problems (MIP)