Porovnat metody
Prohlédněte si vybrané metody vedle sebe; řádky, které se liší, jsou zvýrazněny.
| Algoritmus Ford-Fulkerson× | Simplexová metoda× | |
|---|---|---|
| Obor | Operační výzkum | Operační výzkum |
| Rodina | Machine learning | Machine learning |
| Rok vzniku≠ | 1956 | 1947 |
| Tvůrce≠ | Lester R. Ford and Delbert R. Fulkerson | George Dantzig |
| Typ | algorithm | algorithm |
| Původní zdroj≠ | Ford, L. R., & Fulkerson, D. R. (1956). Maximal flow through a network. Canadian Journal of Mathematics, 8(3), 399-404. DOI ↗ | Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press. DOI ↗ |
| Další názvy≠ | Ford-Fulkerson method, augmenting path method | simplex algorithm |
| Příbuzné | 4 | 4 |
| Shrnutí≠ | The Ford-Fulkerson Algorithm, developed by Lester R. Ford and Delbert R. Fulkerson in 1956, is a foundational method for computing the maximum flow in a flow network. It finds the maximum amount of flow that can be sent from a source to a sink through a directed graph with capacity constraints on edges. | The Simplex Method, developed by George Dantzig in 1947, is a foundational algorithm for solving linear programming problems. It systematically explores vertices of the feasible region to find the optimal solution where the objective function is maximized or minimized subject to linear constraints. |
| ScholarGateDatová sada ↗ |
|
|