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. A branch-and-bound algorithm 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.
Read more about Branch And Bound: General Description, Applications
Famous quotes containing the words branch and/or bound:
“When I am finishing a picture I hold some God-made object up to it—a rock, a flower, the branch of a tree or my hand—as a kind of final test. If the painting stands up beside a thing man cannot make, the painting is authentic. If there’s a clash between the two, it is bad art.”
—Marc Chagall (1889–1985)
“To be the subject of alms-giving is trying, and to feel in duty bound to appear cheerfully grateful under the trial, must be still more so.”
—Herman Melville (1819–1891)