Branch and Bound
Exact tree search that prunes subproblems using bounds.
Also called: Branch and Bound · B&B · 분기-가격(확장)
Last verified: 2026-05-27
An exact search that partitions the solution space into a tree of subproblems and, at each node, computes a bound (a limit on the best value that branch can reach) to prune any branch that cannot beat the incumbent — the stronger the bound, the more of the tree it cuts. It is the backbone of exact methods for cutting & packing such as 2D Bin Packing, and combined with column generation it becomes branch-and-price for integer programs with many variables.
Claims & evidence
Every relationship is a claim with an equivalence level and an evidence grade. See the evidence policy.
No claims recorded yet.
Neighborhood
Direct graph neighbors. Toggle depth to expand.
See also
Not directly linked, but conceptually close — by the connections and descriptions they share.