C Name

CPX_PARAM_NODESEL

C++ Name

NodeSel

Java Name

NodeSel

.NET Name

NodeSel

InteractiveOptimizer

mip strategy nodeselect

Identifier

2018

Description

Used to set the rule for selecting the next node to process when backtracking. The depth-first search strategy chooses the most recently created node. The best-bound strategy chooses the node with the best objective function for the associated LP relaxation. The best-estimate strategy selects the node with the best estimate of the integer objective value that would be obtained from a node once all integer infeasibilities are removed. An alternative best-estimate search is also available.

Values