Efficient GPU-based implementations of simplex type algorithms
From MaRDI portal
(Redirected from Publication:902763)
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
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3561084 (Why is no real title available?)
- A computational comparison of scaling techniques for linear optimization problems on a graphical processing unit
- A new efficient primal dual simplex algorithm
- A parallel implementation of the revised simplex algorithm using OpenMP: some preliminary results
- A practicable steepest-edge simplex algorithm
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- Advances in design and implementation of optimization software
- An efficient simplex type algorithm for sparse and dense linear programs.
- An infeasible (exterior point) simplex algorithm for assignment problems
- Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
- Efficient GPU-based implementations of simplex type algorithms
- Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers
- Implementing an interior point method for linear programs on a CPU-GPU system
- On the efficacy of distributed simplex algorithms for linear programming
- Parallelizing the Dual Simplex Method
- Pivoting rules for the revised simplex algorithm
- SIMPAR: A parallel sparse simplex
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- The Average number of pivot steps required by the Simplex-Method is polynomial
- The Product Form for the Inverse in the Simplex Method
- Towards a practical parallelisation of the simplex method
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
- A low-space algorithm for the subset-sum problem on GPU
- Improving a primal–dual simplex-type algorithm using interior point methods
- 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
Describes a project that uses
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)
