Towards a practical parallelisation of the simplex method
From MaRDI portal
Publication:970132
DOI10.1007/s10287-008-0080-5zbMath1185.90149OpenAlexW2066443208MaRDI QIDQ970132
Publication date: 10 May 2010
Published in: Computational Management Science (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/17773139/Towards_a_practical_parallelisation_of_the_simplex_method.pdf
Related Items
Parallel search paths for the simplex algorithm ⋮ Crash start of interior point methods ⋮ Parallelizing the dual revised simplex method ⋮ Advances in the Parallelization of the Simplex Method ⋮ Computing in Operations Research Using Julia ⋮ Could we use a million cores to solve an integer program? ⋮ Efficient GPU-based implementations of simplex type algorithms ⋮ Interior point methods 25 years later ⋮ COAP 2013 Best Paper Prize ⋮ Improving a primal–dual simplex-type algorithm using interior point methods ⋮ Using massively parallel computations for absolutely precise solution of the linear programming problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fully Asynchronous Multifrontal Solver Using Distributed Dynamic Scheduling
- Vector processing in simplex and interior methods for linear programming
- Parallel solution of large-scale, block-angular linear programs
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- Decomposition of linear programs using parallel computation
- Partitioning procedures for solving mixed-variables programming problems
- Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers
- A practical anti-cycling procedure for linearly constrained optimization
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- Parallelization and aggregation of nested Benders decomposition
- Load balancing in the parallel optimization of block-angular linear programs
- On the efficacy of distributed simplex algorithms for linear programming
- Partitioning mathematical programs for parallel solution
- Scalable parallel Benders decomposition for stochastic linear programming
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- A parallel primal-dual simplex algorithm
- Investigating the sparse simplex algorithm on a distributed memory multiprocessor
- Steepest-edge simplex algorithms for linear programming
- SIMPAR: A parallel sparse simplex
- Hyper-sparsity in the revised simplex method and how to exploit it
- The Elimination form of the Inverse and its Application to Linear Programming
- Evolution of Linear Programming Computing Techniques
- Linear Programming on Cray Supercomputers
- The network simplex method on a multiprocessor
- Decomposition Principle for Linear Programs
- Solving Real-World Linear Programs: A Decade and More of Progress
- A parallel linear system solver
- A practicable steepest-edge simplex algorithm
- Parallel Numerical Optimization: Current Status and an Annotated Bibliography
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- A Supernodal Approach to Sparse Partial Pivoting
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- Stochastic Dedication: Designing Fixed Income Portfolios Using Massively Parallel Benders Decomposition
- Parallelizing the Dual Simplex Method
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
- Diagonal Markowitz Scheme with Local Symmetrization
- SuperLU_DIST
- Pivoting for Size and Sparsity in Linear Programming Inversion Routes
- Pivot selection methods of the Devex LP code
- The Product Form for the Inverse in the Simplex Method
This page was built for publication: Towards a practical parallelisation of the simplex method
