理学 算法设计 释 branch and bound 分支限界法 以广度优先或最小耗费优先的方式搜索解空间树，不断淘汰较差的解，使搜索朝着解空间树上有最优解的分支前进。
branch and bound 分支定界
理论计算机科学 算法设计与分析 释文 branch and bound 分支限界 理论计算机科学 算法设计与分析 释文 branch and bound 分支限界
- information fairness
- information family
- information feedback
- information fidelity
- information filtering
- information filting
- information flow
- information flow advertisement
- information flow in steel manufacturing process
- information flow theory
- information foraging theory
- Information for All Programme
- information for discrimination
- information forensics
- information frame
- information from subordinates is conveyed to superiors
- information function
- information fusion
- information fusion estimation
- information fusion fault diagnosis method
- information fusion on-line detection and recognition
- information fusion service
- information gain
- information gap
- Information Gathering Satellite