Parallelizing the Dual Simplex Method
From MaRDI portal
Publication:4427319
DOI10.1287/ijoc.12.1.45.11902zbMath1034.90008OpenAlexW1978491979MaRDI QIDQ4427319
Alexander Martin, Robert E. Bixby
Publication date: 6 November 2003
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.12.1.45.11902
Related Items
Parallel search paths for the simplex algorithm ⋮ Parallelizing the dual revised simplex method ⋮ Advances in the Parallelization of the Simplex Method ⋮ Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms ⋮ Could we use a million cores to solve an integer program? ⋮ Efficient GPU-based implementations of simplex type algorithms ⋮ A parallel implementation of the simplex function minimization routine ⋮ Towards a practical parallelisation of the simplex method ⋮ Using massively parallel computations for absolutely precise solution of the linear programming problems ⋮ Analysis of stochastic problem decomposition algorithms in computational grids ⋮ Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation ⋮ A parallel primal-dual simplex algorithm
Uses Software
