scientific article; zbMATH DE number 3121287

MaRDI QIDQ3236245zbMATH OpenFDO

Authors George Dantzig, L. R. jun. Ford, D. R. Fulkerson

Publication date 1956

zbMATH Keywords

BiomathematicsInsurance MathematicsOperations Research

Cited in

(16)

• Approximate labelled subtree homeomorphism
• Penelope's graph: a hard minimum cost tension instance
• Computing maximum mean cuts
• An efficient P-D algorithm for shortest path problem
• A parallel primal-dual simplex algorithm
• Dynamic algorithms via the primal-dual method
• Improved solution to data gathering with mobile mule
• Optimum flows in general communication networks
• Design of dynamic algorithms via primal-dual method
• A network simplex method
• The minimal cost maximum matching of a graph
• Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple
• A primal-dual simplex method for linear programs
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow
• Local ratio with negative weights.
• George Dantzig's impact on the theory of computation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3236245)