Confronta i metodi
Esamina i metodi selezionati fianco a fianco; le righe che differiscono sono evidenziate.
| Algoritmo di Wagner-Whitin× | Decomposizione di Benders× | |
|---|---|---|
| Campo | Ricerca operativa | Ricerca operativa |
| Famiglia | Machine learning | Machine learning |
| Anno di origine≠ | 1958 | 1962 |
| Ideatore≠ | Harvey M. Wagner and Thomson M. Whitin | Jacques F. Benders |
| Tipo | algorithm | algorithm |
| Fonte seminale≠ | 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 ↗ |
| Alias | Wagner-Whitin lot-sizing, dynamic lot-sizing algorithm | cutting plane method, constraint generation |
| Correlati | 3 | 3 |
| Sintesi≠ | 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. |
| ScholarGateInsieme di dati ↗ |
|
|