Publication:3236245
From MaRDI portal
zbMath0072.37701MaRDI QIDQ3236245
George B. Dantzig, D. R. Fulkerson, L. R. Ford, Jr.
Publication date: 1956
Related Items
A primal-dual simplex method for linear programs, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, Penelope's graph: a hard minimum cost tension instance, Computing maximum mean cuts, An efficient P-D algorithm for shortest path problem