HEURSEARCHROOTSELECT

A bit vector for selecting which local search heuristics to apply on the root node of a global solve. Use HEURSEARCHTREESELECT to control local search heuristics during the tree search.

Integer

Bit	Meaning
0	Local search with a large neighborhood. Potentially slow but is good for finding solutions that differs significantly from the incumbent.
1	Local search with a small neighborhood centered around a node LP solution.
2	Local search with a small neighborhood centered around an integer solution. This heuristic will often provide smaller, incremental improvements to an incumbent solution.
3	Local search with a neighborhood set up through the combination of multiple integer solutions.
4	Unused
5	Local search without an objective function. Called seldom and only when no feasible solution is available.
6	Local search with an auxiliary objective function. Called seldom and only when no feasible solution is available.

117

Some of the local search heuristics will benefit from having an existing incumbent solution, but it is not required. An initial solution can also be provided by the user through either XPRSloadmipsol or XPRSreadbinsol.

XPRSmipoptimize ( MIPOPTIMIZE).

HEURSTRATEGY, HEURSEARCHTREESELECT, HEURSEARCHEFFORT.