HEURSEARCHROOTSELECT


Description
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.
Type
Integer
Values
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 
Local search on solutions added by XPRSaddmipsol. If this bit is disabled, a partial or an infeasible solution loaded with XPRSaddmipsol will be rejected without a search being performed.
Default value
17
Note
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.
Affects routines
See also


If you have any comments or suggestions about these pages, please send mail to support@fico.com.

© Copyright 1983-2013 Fair Isaac Corporation. All rights reserved.