理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- rev
- Revalon
- revalve
- revaporization
- Revati
- Revati Crater
- revcur
- revealed comparative advantage index
- revealed preference approach
- revealed theology
- Reveal Her true Identity
- Revealing Original Shape in Officialdom
- revealment
- revelation
- Revelations
- revelle factor
- Revenge in Cuiping Mountain
- Revenge tragedy
- revenue
- Revenue Act of 1971
- revenue and expenditure budgeting method
- revenue budget examination
- Revenue Center
- Revenue Equalisation Reserve Fund
- revenue of administrative and institutional units