理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch-and-bound method 分支定界法 又称“分支限界法” †
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- schedule of capital construction
- scheduler
- scheduling
- scheduling algorithm
- scheduling-and-production theory
- scheduling automation auxiliary subsystem
- scheduling forecasting
- scheduling method
- scheduling model
- scheduling monitor computer
- scheduling of jobs
- scheduling of multiprocessor
- scheduling performance index
- scheduling planning
- scheduling policy
- scheduling policy, scheduling strategy
- scheduling problem
- scheduling rule
- scheduling strategy
- scheduling system
- scheduling system of gas transmission and distribution
- scheduling theory
- scheduling with batching
- scheduling with batching and lot-sizing
- scheduling with time windows/due window scheduling