理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- maximal submanifold
- maximal submodule
- maximal subset
- maximal subspace
- maximal sum-free set
- maximal symmetric operator
- maximal system
- maximal tensor product
- maximal term
- maximal thread
- maximal tolerance dose
- maximal tolerance dose (MTD)
- maximal topology
- maximal tori theorem
- maximal torsion subgroup
- maximal torus
- maximal tree
- maximal triangular algebra
- maximal type
- maximal universal algebra
- maximal value
- maximal voluntary ventilation,MVV
- maximal zero-sum-free set
- maximand
- Maxim Bogdanovich