Описание тега branch-and-bound
Branch and bound is a general technique for finding optimal solutions of various combinatorial and integer programming problems. It entails examining candidates (“branches”), while utilizing knowledge of upper and lower limits (“bounds”) to eliminate sub-trees, to find the optimal solution quicker.
Branch and bound is a general technique for finding optimal solutions of various combinatorial and integer programming problems. It involves partial enumeration, by examining candidates (“branches”), while also utilizing knowledge of upper and lower limits (“bounds”) to eliminate sub-trees.
The B&B technique is widely used in discrete optimization problems where the solution falls in the integer space (Traveling salesman, cutting stock etc.) This method was introduced in 1960.
For further reference: The Wikipedia page on Branch-and-bound (B&B)