Concepts inAn Efficient Algorithm for Determining the Length of the Longest Dead Path in a “LIFO” Branch-and-Bound Exploration Schema
Branch and bound
Branch and bound (BB or B&B) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of fruitless candidates are discarded en masse, by using upper and lower estimated bounds of the quantity being optimized. The method was first proposed by A. H. Land and A. G. Doig in 1960 for discrete programming.
more from Wikipedia