Parallelizing the Dual Simplex Method
From MaRDI portal
Recommendations
Cited in
(21)- Analysis of stochastic problem decomposition algorithms in computational grids
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- A parallel primal-dual simplex algorithm
- Investigating the sparse simplex algorithm on a distributed memory multiprocessor
- Parallel search paths for the simplex algorithm
- Parallelizing the dual revised simplex method
- On the essence of parallel independence for the double-pushout and sesqui-pushout approaches
- SIMPAR: A parallel sparse simplex
- Gigaflops in linear programming
- Could we use a million cores to solve an integer program?
- Using massively parallel computations for absolutely precise solution of the linear programming problems
- A parallel implementation of the simplex function minimization routine
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
- Advances in the parallelization of the simplex method
- scientific article; zbMATH DE number 125195 (Why is no real title available?)
- Generalized Networks: Parallel Algorithms and an Empirical Analysis
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
- Efficient GPU-based implementations of simplex type algorithms
- Towards a practical parallelisation of the simplex method
This page was built for publication: Parallelizing the Dual Simplex Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427319)
