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:
“That man’s the true Conservative
Who lops the mouldered branch away.”
—Alfred Tennyson (1809–1892)
“We must remember when we speak of the “negativism” of the toddler that this is also the child who is intoxicated with the discoveries of the second year, a joyful child who is firmly bound to his parents and his new-found world through ties of love. The so-called negativism is one of the aspects of this development, but under ordinary circumstances it does not become anarchy. It’s a kind of declaration of independence, but there is no intention to unseat the government.”
—Selma H. Fraiberg (20th century)