The network simplex method on a multiprocessor
From MaRDI portal
Numerical mathematical programming methods (65K05) Distributed algorithms (68W15) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35)
Recommendations
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- scientific article; zbMATH DE number 1163097
- Generalized Networks: Parallel Algorithms and an Empirical Analysis
- Parallel arc-allocation algorithms for optimizing generalized networks
- A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates
Cited in
(9)- Efficient parallel algorithms for the minimum cost flow problem
- Complexity analysis of new task allocation problem using network flow method on multicore clusters
- A Primal Simplex Approach to Pure Processing Networks
- Generalized Networks: Parallel Algorithms and an Empirical Analysis
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- scientific article; zbMATH DE number 795218 (Why is no real title available?)
- Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
- Parallel arc-allocation algorithms for optimizing generalized networks
- Towards a practical parallelisation of the simplex method
This page was built for publication: The network simplex method on a multiprocessor
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3197596)