scientific article
From MaRDI portal
Publication:3236245
zbMath0072.37701MaRDI QIDQ3236245
D. R. Fulkerson, L. R. Ford, Jr., George B. Dantzig
Publication date: 1956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Computing maximum mean cuts, Design of Dynamic Algorithms via Primal-Dual Method, Dynamic algorithms via the primal-dual method, An efficient P-D algorithm for shortest path problem, Penelope's graph: a hard minimum cost tension instance, The minimal cost maximum matching of a graph, Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple, Improved solution to data gathering with mobile mule, George Dantzig's impact on the theory of computation, A primal-dual simplex method for linear programs, Two strongly polynomial cut cancelling algorithms for minimum cost network flow, A network simplex method, Local ratio with negative weights., Approximate labelled subtree homeomorphism, Optimum flows in general communication networks, A parallel primal-dual simplex algorithm
