Parallel search paths for the simplex algorithm

DOI10.1007/s10100-016-0452-9zbMath1390.90385OpenAlexW2510269008MaRDI QIDQ1642812

István Maros, Bálint Stágel, Péter Tar

Publication date: 15 June 2018

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-016-0452-9

zbMATH Keywords

linear programmingparallelizationsimplex method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Parallel algorithms in computer science (68W10) Parallel numerical computation (65Y05) Extreme-point and pivoting methods (90C49)

Related Items

Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood, Editorial

Uses Software

• ASYNPLEX
• KORBX
• PARSMI
• ParISS
• Pannon Optimizer
• HiGHS

Cites Work

• Unnamed Item
• Unnamed Item
• ParISS
• Towards a practical parallelisation of the simplex method
• 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
• On the efficacy of distributed simplex algorithms for linear programming
• A general pricing scheme for the simplex method
• Advances in design and implementation of optimization software
• Investigating the sparse simplex algorithm on a distributed memory multiprocessor
• Computational techniques of the simplex method
• Novel update techniques for the revised simplex method
• Hyper-sparsity in the revised simplex method and how to exploit it
• The Elimination form of the Inverse and its Application to Linear Programming
• Solving Real-World Linear Programs: A Decade and More of Progress
• Parallelizing the Dual Simplex Method
• Data-Parallel Implementations of Dense Simplex Methods on the Connection Machine CM-2
• The Product Form for the Inverse in the Simplex Method