An improved primal simplex variant for pure processing networks

DOI10.1145/62038.62041MaRDI QIDQ4729253zbMATH OpenOpenAlexFDO

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

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 programmingminimum-cost flow problemsnetwork problemsnumerical examplesprimal partitioning algorithmsimplex algorithm

Mathematics Subject Classification ID

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

Recommendations

• A Primal Simplex Approach to Pure Processing Networks
• scientific article; zbMATH DE number 3876888
• scientific article; zbMATH DE number 4174642
• scientific article; zbMATH DE number 795215
• scientific article; zbMATH DE number 870979

Cited in

(7)

• Maximum flows in generalized processing networks
• An algorithm to solve the proportional network flow problem
• A compaction scheme and generator for distribution networks
• scientific article; zbMATH DE number 3876888 (Why is no real title available?)
• Computational comparison of two solution procedures for allocation/processing networks
• A Primal Simplex Approach to Pure Processing 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

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