理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- triakisdodecahedron
- triakisoctahedron
- triakistetrahedron
- trial
- trial and error
- trial-and-error method
- trial-and-error procedure
- trial and information management room
- trial at imperial court
- trial by mass media
- trial by media
- trial-centeredness
- trial class system
- trial curve
- trial division
- trial divisor
- Trialeurodes vaporariorum
- trial function
- triallate
- trial marriage
- Trial Method for Heritage Museum Reseachers' Detemination of Post and Promotion
- trial of Japanese war criminals in Class B and C
- trial operation of urban rail transit
- trial organization
- trial pit