Towards a practical parallelisation of the simplex method
From MaRDI portal
Publication:970132
Recommendations
Cites work
- scientific article; zbMATH DE number 125194 (Why is no real title available?)
- scientific article; zbMATH DE number 3612766 (Why is no real title available?)
- scientific article; zbMATH DE number 1041084 (Why is no real title available?)
- scientific article; zbMATH DE number 1113880 (Why is no real title available?)
- scientific article; zbMATH DE number 839542 (Why is no real title available?)
- A Supernodal Approach to Sparse Partial Pivoting
- A fully asynchronous multifrontal solver using distributed dynamic scheduling
- A parallel linear system solver
- A parallel primal-dual simplex algorithm
- A practicable steepest-edge simplex algorithm
- A practical anti-cycling procedure for linearly constrained optimization
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
- Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
- Decomposition Principle for Linear Programs
- Decomposition of linear programs using parallel computation
- Diagonal Markowitz Scheme with Local Symmetrization
- Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers
- Evolution of linear programming computing techniques
- Hyper-sparsity in the revised simplex method and how to exploit it
- Investigating the sparse simplex algorithm on a distributed memory multiprocessor
- Linear Programming on Cray Supercomputers
- Load balancing in the parallel optimization of block-angular linear programs
- MIP: Theory and practice -- closing the gap
- Multifrontal parallel distributed symmetric and unsymmetric solvers
- On the efficacy of distributed simplex algorithms for linear programming
- Parallel Numerical Optimization: Current Status and an Annotated Bibliography
- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- Parallel bundle-based decomposition for large-scale structured mathematical programming problems
- Parallel solution of large-scale, block-angular linear programs
- Parallelization and aggregation of nested Benders decomposition
- Parallelizing the Dual Simplex Method
- Partitioning mathematical programs for parallel solution
- Partitioning procedures for solving mixed-variables programming problems
- Permuting Sparse Rectangular Matrices into Block-Diagonal Form
- Pivot selection methods of the Devex LP code
- Pivoting for Size and Sparsity in Linear Programming Inversion Routes
- SIMPAR: A parallel sparse simplex
- Scalable parallel Benders decomposition for stochastic linear programming
- Solving Real-World Linear Programs: A Decade and More of Progress
- Steepest-edge simplex algorithms for linear programming
- Stochastic Dedication: Designing Fixed Income Portfolios Using Massively Parallel Benders Decomposition
- SuperLU_DIST
- The Product Form for the Inverse in the Simplex Method
- The elimination form of the inverse and its application to linear programming
- The network simplex method on a multiprocessor
- Vector processing in simplex and interior methods for linear programming
Cited in
(19)- Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
- Computing in operations research using Julia
- Parallelizing the dual revised simplex method
- Investigating the sparse simplex algorithm on a distributed memory multiprocessor
- Advances in the parallelization of the simplex method
- Towards a closer integration of finite domain propagation and simplex-based algorithms
- scientific article; zbMATH DE number 3883943 (Why is no real title available?)
- The simplex method as a global optimizer: A \(C\)-programming perspective
- A parallel implementation of the simplex function minimization routine
- Using massively parallel computations for absolutely precise solution of the linear programming problems
- A parallel implementation of the revised simplex algorithm using OpenMP: some preliminary results
- Could we use a million cores to solve an integer program?
- SIMPAR: A parallel sparse simplex
- Crash start of interior point methods
- COAP 2013 Best Paper Prize
- Improving a primal–dual simplex-type algorithm using interior point methods
- Parallel search paths for the simplex algorithm
- Efficient GPU-based implementations of simplex type algorithms
- Interior point methods 25 years later
Describes a project that uses
Uses Software
This page was built for publication: Towards a practical parallelisation of the simplex method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q970132)
