理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- indefiniteness
- indefinite operator
- indefinite orthogonal group
- indefinite problem
- indefinite quadratic form
- indefinite scalar product
- indefinite S integral
- indefinite S-integral
- indefinite summation operator
- indefinite total variation
- indefinite type
- indefinite unitary group
- indefinite weight
- Indego exoskeleton robot
- Indego外骨骼机器人
- in-degree
- indegree
- indegree of a vertex
- indelible
- Indelible Designation
- indemnification for loss
- indemnificatory employment policy
- Indemnificatory housing
- indemnificatory housing
- indemnificatory housing community