Parallelizing the dual revised simplex method
From MaRDI portal
Publication:1646685
DOI10.1007/s12532-017-0130-5zbMath1402.90084arXiv1503.01889OpenAlexW2963956318WikidataQ59613558 ScholiaQ59613558MaRDI QIDQ1646685
Publication date: 25 June 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.01889
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)
Related Items
HiGHS ⋮ Advances in the Parallelization of the Simplex Method ⋮ Absolute value equations with data uncertainty in the $l_1$ and $l_\infty$ norm balls ⋮ JuMP 1.0: recent improvements to a modeling language for mathematical optimization ⋮ Progress in mathematical programming solvers from 2001 to 2020 ⋮ Code-verification techniques for the method-of-moments implementation of the magnetic-field integral equation ⋮ The ‘Idiot’ crash quadratic penalty algorithm for linear programming and its application to linearizations of quadratic assignment problems ⋮ High-dimensional composite quantile regression: optimal statistical guarantees and fast algorithms ⋮ COAP 2013 Best Paper Prize ⋮ A triangulation and fill-reducing initialization procedure for the simplex algorithm
Uses Software
Cites Work
- COIN-OR
- Towards a practical parallelisation of the simplex method
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation
- ASYNPLEX, an asynchronous parallel revised simplex algorithm
- Steepest-edge simplex algorithms for linear programming
- Novel update techniques for the revised simplex method
- Hyper-sparsity in the revised simplex method and how to exploit it
- Evolution of Linear Programming Computing Techniques
- Parallelizing the Dual Simplex Method
- Updated triangular factors of the basis to maintain sparsity in the product form simplex method
- Pivot selection methods of the Devex LP code
- Unnamed Item
- Unnamed Item
