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 Default value 17 Note Affects routines See also
If you have any comments or suggestions about these pages, please send mail to firstname.lastname@example.org.
© Copyright 1983-2013 Fair Isaac Corporation. All rights reserved.