The Branch and Bound (BB or B&B) algorithm is first proposed by A. H. Land and A. G. Doig in 1960 for
discrete programming. It is a general algorithm for finding optimal solutions of various optimization problems,
especially in discrete and combinatorial optimization. A branch and bound algorithm consists of...