理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- zero of an algebraic system
- zero of an entire function
- zero of an ideal
- zero of a polynomial
- zero of a ring
- zero of a skew field
- zero of a solution
- zero of a vector field
- zero of multiplicity n
- zero of multiplicity two
- zero of order k
- zero-one distribution
- zero one integer programming
- zero-one integer programming
- zero one law
- zero-one law
- zero-one method
- zero-one optimization
- zero-one programming
- zero-one sequence
- zero operator
- zero order
- zero-order-hold
- zero-order Laue zone
- zero order spectrum