ASYNPLEX, an asynchronous parallel revised simplex algorithm
From MaRDI portal
Publication:1265868
DOI10.1023/A:1018957107705zbMath0906.90119MaRDI QIDQ1265868
J. A. J. Hall, K. I. M. McKinnon
Publication date: 27 September 1998
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (10)
Parallel search paths for the simplex algorithm ⋮ Parallelizing the dual revised simplex method ⋮ Advances in the Parallelization of the Simplex Method ⋮ A distributed simplex algorithm for degenerate linear programs and multi-agent assignments ⋮ Efficient GPU-based implementations of simplex type algorithms ⋮ COAP 2013 Best Paper Prize ⋮ Improving a primal–dual simplex-type algorithm using interior point methods ⋮ Towards a practical parallelisation of the simplex method ⋮ ASYNPLEX ⋮ Non-smooth optimization methods for computation of the Conditional Value-at-risk and portfolio optimization
Uses Software
This page was built for publication: ASYNPLEX, an asynchronous parallel revised simplex algorithm
