A Primal Simplex Approach to Pure Processing Networks
From MaRDI portal
Publication:3750474
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
Cited in
(11)- An improved primal simplex variant for pure processing networks
- A survey of dynamic network flows
- Dynamic factorization in large-scale optimization
- A compaction scheme and generator for distribution networks
- Maximum flows in generalized processing networks
- Computational comparison of two solution procedures for allocation/processing networks
- Extending and solving a multiperiod congested network flow model
- Triangularity of the basis in linear programs for material requirements planning
- A fast algorithm for bounded generalized processing networks
- Future paths for integer programming and links to artificial intelligence
- scientific article; zbMATH DE number 3876888 (Why is no real title available?)
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)