scientific article; zbMATH DE number 870979

MaRDI QIDQ4876199zbMATH OpenFDO

Authors El-Sayed M. El-Horbaty

Publication date 28 April 1996

zbMATH Keywords

minimum cost flow problemsparallel versionprimal-simplex algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Parallel primal-dual methods for the minimum cost flow problem
• scientific article; zbMATH DE number 4174642
• Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
• Efficient parallel algorithms for the minimum cost flow problem

Cited in

(2)

• An improved primal simplex variant for pure processing networks
• Efficient parallel algorithms for the minimum cost flow problem

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 Q4876199)