# Search tree

The tree formed by a branch and bound algorithm strategy. It is a tree because at each (forward) branching step the problem is partitioned into a disjunction. A common one is to dichotomize the value of some variable, $LaTeX: \textstyle x \le v \mbox{ or } x \ge v + 1.$ This creates two nodes from the parent: