方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Wagner-Whitin 算法× | Benders Decomposition× | |
|---|---|---|
| 领域 | 运筹学 | 运筹学 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1958 | 1962 |
| 提出者≠ | Harvey M. Wagner and Thomson M. Whitin | Jacques F. Benders |
| 类型 | algorithm | algorithm |
| 开创性文献≠ | Wagner, H. M., & Whitin, T. M. (1958). Dynamic version of the economic lot size model. Management Science, 5(1), 89-96. DOI ↗ | Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238-252. DOI ↗ |
| 别名 | Wagner-Whitin lot-sizing, dynamic lot-sizing algorithm | cutting plane method, constraint generation |
| 相关 | 3 | 3 |
| 摘要≠ | The Wagner-Whitin Algorithm, introduced by Harvey M. Wagner and Thomson M. Whitin in 1958, is a dynamic programming solution to the capacitated lot-sizing problem. It determines optimal production quantities over multiple periods to minimize the total cost of production setup and inventory holding while meeting deterministic demand. | Benders Decomposition, introduced by Jacques F. Benders in 1962, is a powerful algorithmic framework for solving large-scale mixed-integer programming (MIP) problems. It decomposes the problem into a master problem (controlling complicating variables) and subproblems (handling remaining variables), using cutting planes generated from subproblem dual information to iteratively tighten the master problem. |
| ScholarGate数据集 ↗ |
|
|