Efficient Branch and Bound Search with Application to Computer-Aided Design

In many applications, the classic branch-and-bound search methods perform duplications of computations, or rely on the search decision trees which keep track of the branch-and-bound search processes.