理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- standstill
- standstill in enacting
- stand structure
- stand-table projection
- stand test
- stand volume
- Stanford-Binet Intelligence Scale
- Stanford-BinetScale in Chinese
- Stanford Diagnostic Reading Test
- Stanford Industrial Park
- Stanford Moore
- Stanford prison experiment
- Stanford Protocol Proposal for Internet Retrieval and Search，STARTS
- Stanford Research Institute(SRI) International
- Stanford University
- Stanford University Libraries（SUL）
- Stanford University Press
- stanine
- Stanislao Cannizzaro
- Stanislas Julien
- Stanislav Iosifovich Rostotsky
- Stanislav Konstantinovich Smirnov
- Stanislav Kostka Neumann
- Stanislavsky’s acting system
- Stanislav Strnad