方法对比
并排查看您选择的方法；存在差异的行会高亮显示。
| Ford-Fulkerson 算法× | 单纯形法× | |
|---|---|---|
| 领域 | 运筹学 | 运筹学 |
| 方法族 | Machine learning | Machine learning |
| 起源年份≠ | 1956 | 1947 |
| 提出者≠ | Lester R. Ford and Delbert R. Fulkerson | George Dantzig |
| 类型 | algorithm | algorithm |
| 开创性文献≠ | 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 ↗ |
| 别名≠ | Ford-Fulkerson method, augmenting path method | simplex algorithm |
| 相关 | 4 | 4 |
| 摘要≠ | 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. |
| ScholarGate数据集 ↗ |
|
|