Efficient GPU-based implementations of simplex type algorithms
From MaRDI portal
Publication:902763
DOI10.1016/j.amc.2014.10.096zbMath1328.90003OpenAlexW2069420277MaRDI QIDQ902763
Nikolaos Ploskas, Nikolaos Samaras
Publication date: 4 January 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.10.096
Numerical mathematical programming methods (65K05) Linear programming (90C05) Parallel numerical computation (65Y05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (5)
Advances in the Parallelization of the Simplex Method ⋮ Efficient GPU-based implementations of simplex type algorithms ⋮ Exterior point simplex-type algorithms for linear and network optimization problems ⋮ Improving a primal–dual simplex-type algorithm using interior point methods ⋮ Integer programming for urban design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An infeasible (exterior point) simplex algorithm for assignment problems
- Implementing an interior point method for linear programs on a CPU-GPU system
- Efficient GPU-based implementations of simplex type algorithms
- Towards a practical parallelisation of the simplex method
- Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- On the efficacy of distributed simplex algorithms for linear programming
- Advances in design and implementation of optimization software
- An efficient simplex type algorithm for sparse and dense linear programs.
- A new efficient primal dual simplex algorithm
- SIMPAR: A parallel sparse simplex
- Pivoting rules for the revised simplex algorithm
- A practicable steepest-edge simplex algorithm
- The Average number of pivot steps required by the Simplex-Method is polynomial
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- Parallelizing the Dual Simplex Method
- A Parallel Implementation of the Revised Simplex Algorithm Using OpenMP: Some Preliminary Results
- Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
- The Product Form for the Inverse in the Simplex Method
This page was built for publication: Efficient GPU-based implementations of simplex type algorithms
