[Previous] [Next]

BACKTRACK

Description
Branch and Bound: This determines how the next node in the tree search is selected for processing.
Type
Integer
Values
1 
If MIPTARGET is not set, choose the node with the best estimate. If MIPTARGET is set (by the user or by the global search previously finding an integer solution), the choice is based on the Forrest‑Hirst‑Tomlin Criterion, which takes into account the best current integer solution and seeks a new node which represents a large potential improvement.
2 
Always choose the node with the best estimated solution.
3 
Always choose the node with the best bound on the solution.
Default value
3
Affects routines
XPRSglobal (GLOBAL).

[Previous] [Next] [Index]
If you have any comments or suggestions about these pages, please send mail to docs@dashoptimization.com.