ASYNPLEX, an asynchronous parallel revised simplex algorithm

DOI10.1023/A:1018957107705MaRDI QIDQ1265868zbMATH OpenFDO

Authors J. A. J. Hall, K. I. M. McKinnon

Publication date 27 September 1998

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

linear programmingparallel implementationrevised simplex methodCray T3D

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Linear programming (90C05)

Recommendations

• Parallelizing the Dual Simplex Method
• scientific article; zbMATH DE number 125195
• Asynchronous parallel successive overrelaxation for the symmetric linear complementarity problem
• scientific article; zbMATH DE number 1262856

Cited in

(11)

• Advances in the parallelization of the simplex method
• A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
• Parallel search paths for the simplex algorithm
• Improving a primal–dual simplex-type algorithm using interior point methods
• ASYNPLEX
• Towards a practical parallelisation of the simplex method
• COAP 2013 Best Paper Prize
• Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization
• Efficient GPU-based implementations of simplex type algorithms
• Parallel Asynchronous Hungarian Methods for the Assignment Problem
• Parallelizing the dual revised simplex method

Describes a project that uses

Uses Software

• DEVEX

This page was built for publication: ASYNPLEX, an asynchronous parallel revised simplex algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265868)