An improved primal simplex variant for pure processing networks

DOI10.1145/62038.62041zbMath0679.65042OpenAlexW2026784218MaRDI QIDQ4729253

Michael Engquist, Michael D. Chang, Chou-Hong J. Chen

Publication date: 1989

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1989-15/

zbMATH Keywords

linear programmingnumerical examplessimplex algorithmnetwork problemsminimum-cost flow problemsprimal partitioning algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (4)

An algorithm to solve the proportional network flow problem ⋮ Maximum flows in generalized processing networks ⋮ A compaction scheme and generator for distribution networks ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

This page was built for publication: An improved primal simplex variant for pure processing networks