A parallelization of the simplex method
- 1 December 1988
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 14 (1) , 17-40
- https://doi.org/10.1007/bf02186472
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Implementing Dense Linear Algebra Algorithms Using Multitasking on the CRAY X-MP-4 (or Approaching the Gigaflop)SIAM Journal on Scientific and Statistical Computing, 1986
- Multiprocessing linear algebra algorithms on the CRAY X-MP-2: Experiences with small granularityJournal of Parallel and Distributed Computing, 1984
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming basesMathematical Programming, 1982
- DAP implementation of the WZ algorithmComputer Physics Communications, 1982
- Further analysis of the quadrant interlocking factorisation (Q.I.F.) methodInternational Journal of Computer Mathematics, 1982
- A modification of the quadrant interlocking factorisation parallel methodInternational Journal of Computer Mathematics, 1980
- A parallel linear system solverInternational Journal of Computer Mathematics, 1979
- Updated triangular factors of the basis to maintain sparsity in the product form simplex methodMathematical Programming, 1972
- A stabilization of the simplex methodNumerische Mathematik, 1971
- The Elimination form of the Inverse and its Application to Linear ProgrammingManagement Science, 1957