Pages that link to "Item:Q751499"
From MaRDI portal
The following pages link to Vector processing in simplex and interior methods for linear programming (Q751499):
Displayed 7 items.
- Massive memory buys little speed for complete, in-core sparse Cholesky factorizations on some scalar computers (Q803714) (← links)
- Towards a practical parallelisation of the simplex method (Q970132) (← links)
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
- On the efficacy of distributed simplex algorithms for linear programming (Q1342885) (← links)
- Advances in design and implementation of optimization software (Q1598765) (← links)
- Steepest-edge simplex algorithms for linear programming (Q1802952) (← links)
- Implementing cholesky factorization for interior point methods of linear programming (Q3835659) (← links)