Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Ford-Fulkerson Algoritm× | Simplexmetoden× | |
|---|---|---|
| Ämnesområde | Operationsanalys | Operationsanalys |
| Familj | Machine learning | Machine learning |
| Ursprungsår≠ | 1956 | 1947 |
| Upphovsperson≠ | Lester R. Ford and Delbert R. Fulkerson | George Dantzig |
| Typ | algorithm | algorithm |
| Ursprungskälla≠ | 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 ↗ |
| Alias≠ | Ford-Fulkerson method, augmenting path method | simplex algorithm |
| Närliggande | 4 | 4 |
| Sammanfattning≠ | 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. |
| ScholarGateDatamängd ↗ |
|
|