Efficient GPU-based implementations of simplex type algorithms
DOI10.1016/J.AMC.2014.10.096zbMATH Open1328.90003OpenAlexW2069420277MaRDI QIDQ902763FDOQ902763
Authors: 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
Recommendations
- Implementing an interior point method for linear programs on a CPU-GPU system
- Advances in the parallelization of the simplex method
- Parallelizing the dual revised simplex method
- Efficient parallel linear programming
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Linear programming (90C05) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Cites Work
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- SIMPAR: A parallel sparse simplex
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- A new efficient primal dual simplex algorithm
- A practicable steepest-edge simplex algorithm
- Towards a practical parallelisation of the simplex method
- Title not available (Why is that?)
- The Average number of pivot steps required by the Simplex-Method is polynomial
- An efficient simplex type algorithm for sparse and dense linear programs.
- An infeasible (exterior point) simplex algorithm for assignment problems
- Efficient GPU-based implementations of simplex type algorithms
- The Product Form for the Inverse in the Simplex Method
- Implementing an interior point method for linear programs on a CPU-GPU system
- Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers
- On the efficacy of distributed simplex algorithms for linear programming
- Advances in design and implementation of optimization software
- Pivoting rules for the revised simplex algorithm
- 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
Cited In (12)
- Advances in the parallelization of the simplex method
- Implementing an interior point method for linear programs on a CPU-GPU system
- Simulating a P system based efficient solution to SAT by using GPUs
- Integer programming for urban design
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
- Improving a primal–dual simplex-type algorithm using interior point methods
- A low-space algorithm for the subset-sum problem on GPU
- Exterior point simplex-type algorithms for linear and network optimization problems
- Using GPU computing for solving the two-dimensional guillotine cutting problem
- Searching approximate global optimal Heilbronn configurations of nine points in the unit square via GPGPU computing
- GPU parameter tuning for tall and skinny dense linear least squares problems
- Efficient GPU-based implementations of simplex type algorithms
Uses Software
This page was built for publication: Efficient GPU-based implementations of simplex type algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q902763)
