|
Related articles:
Algorithm
Alpha-beta pruning
Linear programming
Parallel computing
Key terms: math bound set tree upper minimum method problem nodes search value algorithm within branching procedure lower bound whose given design function global candidate pruning paradigm among all upper bound programming application search tree step is called upper and lower bounds Search external links cited by footnotes on Wikipedia page Branch and bound: |
|