Porównaj metody
Przeglądaj wybrane metody obok siebie; wiersze, które się różnią, są wyróżnione.
| Dekompozycja Bendersa× | Generowanie kolumn (Dantzig-Wolfe)× | |
|---|---|---|
| Dziedzina | Badania operacyjne | Badania operacyjne |
| Rodzina | Machine learning | Machine learning |
| Rok powstania≠ | 1962 | 1960 |
| Twórca≠ | Jacques F. Benders | George B. Dantzig and Philip Wolfe |
| Typ | algorithm | algorithm |
| Źródło pierwotne≠ | Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4(1), 238-252. DOI ↗ | Dantzig, G. B., & Wolfe, P. (1960). Decomposition principle for linear programs. Operations Research, 8(1), 101-111. DOI ↗ |
| Inne nazwy | cutting plane method, constraint generation | Dantzig-Wolfe decomposition, column generation method |
| Pokrewne | 3 | 3 |
| Podsumowanie≠ | 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. | Column Generation, developed by George B. Dantzig and Philip Wolfe in 1960, is a powerful optimization technique for solving large-scale linear programming problems with special structure. Also known as Dantzig-Wolfe Decomposition, it decomposes the problem into a master problem (restricted to a subset of variables/columns) and a pricing subproblem (identifying new variables), iteratively improving the solution by introducing only relevant columns. |
| ScholarGateZbiór danych ↗ |
|
|