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:
“What can the dove of Jesus give
You now but wisdom, exile? Stand and live,
The dove has brought an olive branch to eat.”
—Robert Lowell (1917–1977)
“Adrift dissolving, bound for death;
Though lumpish thou, a lumbering one—
A lumbering lubbard loitering slow,
Impingers rue thee and go down,
Sounding thy precipice below,
Nor stir the slimy slug that sprawls
Along thy dead indifference of walls.”
—Herman Melville (1819–1891)