理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- Identified-subeconomic Resources
- identified ultraviolet source
- identified X-ray source
- identified γ-ray source
- identifier
- identifier element
- identifier state
- identify
- identifying
- identifying algorithm
- identifying index
- identifying line
- Identifying the region and order
- identities of algebras
- identities of Yangian invariants
- identities of Yangian-invariants
- identity
- identity authentication
- identity authentication service
- identity automorphism
- identity axiom
- identity based cryptography
- identity-based cryptography
- identity based encryption
- identity-based encryption