理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- dual relation
- dual representation
- dual resonance
- dual resonance model
- dual-roll press formation
- dual root system
- dual-rotation friction stir welding
- dual scalar
- dual scaling
- dual scheduling
- dual semi-group
- dual semigroup
- dual sentence
- dual simplex algorithm
- dual simplex method
- dual simplex tableau
- dual solid
- dual solution
- dual space
- dual spaces
- dual specificity phosphatase
- dual-specificity phosphatase
- dual stack system
- dual standard form
- dual star