Advances in the Parallelization of the Simplex Method

DOI10.1007/978-3-319-24024-4_17zbMath1331.90038OpenAlexW1869720033MaRDI QIDQ3464476

B. Mamalis, Grammati E. Pantziou

Publication date: 27 January 2016

Published in: Algorithms, Probability, Networks, and Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-24024-4_17

zbMATH Keywords

parallel computingsimplex methodlinear programmingm

Mathematics Subject Classification ID

Linear programming (90C05) Parallel algorithms in computer science (68W10)

Related Items (1)

Improving a primal–dual simplex-type algorithm using interior point methods

Uses Software

• Benchmarks for Optimization Software
• XPRESS
• PARSMI
• ParISS
• HiGHS

Cites Work

• Unnamed Item
• Efficient GPU-based implementations of simplex type algorithms
• Towards a practical parallelisation of the simplex method
• A parallel algorithm for linear programming problems
• Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers
• ASYNPLEX, an asynchronous parallel revised simplex algorithm
• On the efficacy of distributed simplex algorithms for linear programming
• A parallel primal-dual simplex algorithm
• Investigating the sparse simplex algorithm on a distributed memory multiprocessor
• Parallelizing the dual revised simplex method
• Parallel distributed-memory simplex for large-scale stochastic LP problems
• Introduction to Stochastic Programming
• Parallelizing the Dual Simplex Method
• Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2

This page was built for publication: Advances in the Parallelization of the Simplex Method