理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- monotone difference scheme
- monotone equivalence
- monotone family
- monotone flow
- monotone function
- monotone increasing
- monotone increasing function
- monotone increasing sequence
- monotone law
- monotone likelihood ratio
- monotone mapping
- monotone mapping into itself
- monotone matrix
- monotone nondecreasing function
- monotone nonincreasing sequence
- monotone operator
- monotone-operator theorem
- monotone ordinals
- monotone process
- monotone quasi-order
- monotone ratio
- monotone sequence
- monotone set
- monotone system
- monotone transformation