理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- theories of social work
- theories of sport training
- theories of the information society
- Theories of Vladimir Ivanovich Nemirovich-Danchenko
- Theories on Painting and Images of the Mind
- The Original Mirror of Al-chemical Prescriptions
- The Original Salvation Song
- The Original Way of Awakening
- The Origin and Evolution of Huangmei Opera
- the origin of birds
- the origin of class
- the origin of law
- the origin of livestock breeding
- the origin of morality
- The Origin of New Literature in China
- The Origin of the Family, Private Property and the State
- the origin of the literature
- The Origin of the Mongols/Jewelled Summary
- The Origin of the Work of Art
- The Origin of Thoughts
- The Origin of Writing
- The Origins of Museums: The Cabinet of Curiosities in Sixteenth and Seventeenth-Century Europe
- The Origins of Totalitarianism
- theoritical occupation density
- The Orphan of Zhao