理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- The Golden Conch
- The Golden Eagle
- The Golden Hedgehog University Students' Drama Festival
- The Golden History of Mongolia by Lobsangdanjin
- The Golden Notebook
- The golden pig conuntries
- The Golden Road
- The Golden Rose
- the golden rule
- The Golden Seal of Su Qin
- The Golden Swallow
- The Golden Wing：A Family Chronicle
- The Gold-like Blood
- The Gold Rush
- The Golovlyov Family
- The Good and the Evil
- The Good EarthTrilogy
- The Good Person of Szechwan
- The Good Soldier
- The Good Soldier Schweik
- The Good Woman Neongma
- the Gordon Riots
- The Gorgeous Cloud Pavilion
- the governance of the subaltern society
- The Government Inspector