A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions

SummaryFor monotonic Boolean functions, a branch-and-bound algorithm is given for constructing an optimal decision tree (sequential evaluation procedure). The tree is optimal in minimizing the average number of variables which need to be examined.