理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- planning mathematics
- planning of ancient Chinese city
- planning of an experiment
- planning of Beijing
- Planning of Canberra
- planning of capitalist economy
- planning of Chandigarh
- planning of Chinese Academy of Sciences
- planning of Chinese city (1840～1949)
- planning of Chinese early-modern city
- planning of civil air defense engineering system
- planning of establishing chinese environmental protection model city
- planning of grassland construction
- Planning of Greater London
- planning of Guangzhou
- planning of Guangzhou Asian Games
- planning of Guangzhou Economic and Technological Development Distinct
- Planning of Guangzhou Higher Education Mega Center
- planning of guidance to economic development
- planning of Hangzhou
- planning of Hankou British Concession
- Planning of Hongqiao Economic and Technological Development Zone
- planning of landscape plants
- planning of landscape tour
- planning of landscape tourist areas