Term Details

Display Hierarchical | Alphabetical | KWOC | KWIC


Top Terms > Mathematics > General principles of mathematics > Mathematical models > Algorithms > Branch and bound algorithms

Find related records

Search with TRT term only:

TRB Publications Index
Research in Progress
TRID

Expanded search with
narrower TRT terms:

TRB Publications Index
Research in Progress
TRID

Branch and bound algorithms (Ubmgb)

Definition
General algorithms for finding optimal solutions of optimization problems, typically in discrete and combinatorial optimization, by eliminating large subsets of candidate solutions on the basis of the upper and lower estimated bounds of the quantity being optimized. (Source: Team)
Broader Term
Algorithms (Ubmg)
Related Terms (Hierarchical)
Computer algorithms (Ubmgc)
Fuzzy algorithms (Ubmgf)
Genetic algorithms (Ubmgg)
Shortest path algorithms (Ubmgq)
Simplex method (Ubmgs)
Progression (Mathematics) (Ubmgu)
Related Terms (Associative)
Nonlinear programming (Ubbpp)