Towards a practical parallelisation of the simplex method
type: Item
instance of: scholarly article
title: Towards a practical parallelisation of the simplex method
zbMATH Open document ID: 1185.90149
author: J. A. J. Hall
published in: Computational Management Science
publication date: 2010-05-10T00:00:00Z
full work available at URL: Towards a practical parallelisation of the simplex method.pdf
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 5706020
zbMATH Keywords: sparse
describes a project that uses: SoPlex
describes a project that uses: Benchmarks for Optimization Software
describes a project that uses: MUMPS
describes a project that uses: KORBX
describes a project that uses: DEVEX
describes a project that uses: SuperLU-DIST
describes a project that uses: ASYNPLEX
describes a project that uses: SuperLU
describes a project that uses: SIMPAR
describes a project that uses: SYNPLEX
describes a project that uses: PARSMI
MaRDI profile type: Publication
OpenAlex ID: W2066443208
cites work: Multifrontal parallel distributed symmetric and unsymmetric solvers
cites work: A fully asynchronous multifrontal solver using distributed dynamic scheduling
cites work: Diagonal Markowitz Scheme with Local Symmetrization
cites work: Permuting Sparse Rectangular Matrices into Block-Diagonal Form
cites work: Parallel Simplex for Large Pure Network Problems: Computational Testing and Sources of Speedup
cites work: Linear Programming on Cray Supercomputers
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Solving Real-World Linear Programs: A Decade and More of Progress
cites work: Parallelizing the Dual Simplex Method
cites work: MIP: Theory and practice -- closing the gap
cites work: Q4177319
cites work: Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers
cites work: Decomposition Principle for Linear Programs
cites work: The Product Form for the Inverse in the Simplex Method
cites work: A Supernodal Approach to Sparse Partial Pivoting
cites work: Parallelization and aggregation of nested Benders decomposition
cites work: Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
cites work: A parallel linear system solver
cites work: Partitioning mathematical programs for parallel solution
cites work: Steepest-edge simplex algorithms for linear programming
cites work: Vector processing in simplex and interior methods for linear programming
cites work: A practical anti-cycling procedure for linearly constrained optimization
cites work: Load balancing in the parallel optimization of block-angular linear programs
cites work: A practicable steepest-edge simplex algorithm
cites work: ASYNPLEX, an asynchronous parallel revised simplex algorithm
cites work: Hyper-sparsity in the revised simplex method and how to exploit it
cites work: Pivot selection methods of the Devex LP code
cites work: Stochastic Dedication: Designing Fixed Income Portfolios Using Massively Parallel Benders Decomposition
cites work: Decomposition of linear programs using parallel computation
cites work: On the efficacy of distributed simplex algorithms for linear programming
cites work: A parallel primal-dual simplex algorithm
cites work: Q4864234
cites work: SIMPAR: A parallel sparse simplex
cites work: SuperLU_DIST
cites work: Q4026886
cites work: The elimination form of the inverse and its application to linear programming
cites work: Investigating the sparse simplex algorithm on a distributed memory multiprocessor
cites work: Parallel bundle-based decomposition for large-scale structured mathematical programming problems
cites work: Scalable parallel Benders decomposition for stochastic linear programming
cites work: Evolution of linear programming computing techniques
cites work: The network simplex method on a multiprocessor
cites work: Q4375656
cites work: Parallel solution of large-scale, block-angular linear programs
cites work: Computing Sparse LU Factorizations for Large-Scale Linear Programming Bases
cites work: Pivoting for Size and Sparsity in Linear Programming Inversion Routes
cites work: Q4346087
cites work: Parallel Numerical Optimization: Current Status and an Annotated Bibliography
DOI: 10.1007/S10287-008-0080-5
description: scientific article; zbMATH DE number 5706020