理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch and bound 分支定界
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界 理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- malnutrition weakness
- malobservation
- malocclusion
- malodorous gas adsorbents
- malodorous gas biosorbent
- malodorous gas chemical absorbent
- malodorous gas physical absorbent
- Malon 9 Kochavim
- Malong Qu
- Ma Longwen
- Ma Longxiang
- malonic acid
- malonyl urea
- mal operon
- Malo Schur Szego composition theorem
- Malo-Schur-Szego composition theorem
- Maloti-Drakensberg Park
- Maloti Mountains
- malpighia family
- mal-posed
- mal-posed problem
- MALT
- malt
- Malta
- maltase