理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- minimal space
- minimal spanning tree
- minimal spectrum
- minimal sphere
- minimal splitting field
- minimal stability
- minimal statistic
- minimal subcover
- minimal subgroup
- minimal submanifold
- minimal subset
- minimal subtraction scheme
- minimal sufficient estimator
- minimal sufficient sigma-field
- minimal sufficient statistic
- minimal supergroup
- minimal supersymmetric standard model
- minimal surface
- minimal surface equation
- minimal surface problem
- minimal system
- minimal system of generators
- minimal system representation
- minimal test
- minimal thread