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:
“The optimist proclaims that we live in the best of all possible worlds; and the pessimist fears this is true.”
—James Branch Cabell (1879–1958)
“Edith: This complete loveliness will fade. And we shall forget what it was like.
Edward: Edith, don’t.
Edith: Oh, it’s bound to. Just a few years and the gilt wears off the gingerbread.
Edward: Darling, answer me one thing truthfully. Have you ever seen gingerbread with gilt on it?
Edith: [laughing] Fool!
Edward: Then the whole argument is disposed of.”
—Reginald Berkeley (1890 N1935)