An experimental approach to karmarkar’s projective method for linear programming
- 1 January 1987
- book chapter
- Published by Springer Nature
- p. 175-191
- https://doi.org/10.1007/bfb0121187
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Integration of a primal simplex network algorithm with a large-scale mathematical programming systemACM Transactions on Mathematical Software, 1985
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A new release of SPARSPAKACM SIGNUM Newsletter, 1984
- A Fast Way to Solve Hard ProblemsScience, 1984
- Numerical Methods for Large Sparse Linear Least Squares ProblemsSIAM Journal on Scientific and Statistical Computing, 1984
- Formal optimization of some reduced linear programming problemsMathematical Programming, 1983
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least SquaresACM Transactions on Mathematical Software, 1982
- Solution of sparse linear least squares problems using givens rotationsLinear Algebra and its Applications, 1980
- The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational resultsMathematical Programming, 1977