Process / pipelineMathematical programming
分支定界法 (Branch and Bound)
分支定界法是一种用于组合优化和整数规划问题的系统性精确算法，由 Ailsa Land 和 Alison Doig 于 1960 年提出。它将搜索空间组织成一个子问题树，利用松弛法导出的上界来剪除无法改进已知最优解的分支，并保证找到全局最优整数解。它是运筹学、物流、调度和工程设计中现代混合整数规划求解器的基石。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Land, A. H., & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Econometrica, 28(3), 497–520. DOI: 10.2307/1910129 ↗
如何引用本页
ScholarGate. (2026, June 2). Branch and Bound. ScholarGate. https://scholargate.app/zh/optimization/branch-and-bound
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →