A Primal Simplex Approach to Pure Processing Networks
From MaRDI portal
Publication:3750474
DOI10.1287/MNSC.32.12.1582zbMATH Open0609.90042OpenAlexW2128498640MaRDI QIDQ3750474FDOQ3750474
Authors: Chou-Hong J. Chen, Michael Engquist 
Publication date: 1986
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.32.12.1582
Recommendations
- An improved primal simplex variant for pure processing networks
- scientific article; zbMATH DE number 4174642
- The network simplex method on a multiprocessor
- scientific article; zbMATH DE number 3876888
- scientific article; zbMATH DE number 795215
- scientific article; zbMATH DE number 1086915
- An efficient implementation of the network simplex method
- scientific article; zbMATH DE number 1195629
- scientific article; zbMATH DE number 1766755
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cited In (11)
- Triangularity of the basis in linear programs for material requirements planning
- Dynamic factorization in large-scale optimization
- Future paths for integer programming and links to artificial intelligence
- A fast algorithm for bounded generalized processing networks
- Maximum flows in generalized processing networks
- Computational comparison of two solution procedures for allocation/processing networks
- Title not available (Why is that?)
- A survey of dynamic network flows
- Extending and solving a multiperiod congested network flow model
- An improved primal simplex variant for pure processing networks
- A compaction scheme and generator for distribution networks
This page was built for publication: A Primal Simplex Approach to Pure Processing Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3750474)
