New crash procedures for large systems of linear constraints
- 1 August 1989
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 45 (1-3) , 475-501
- https://doi.org/10.1007/bf01589115
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Distribution of mathematical software via electronic mailCommunications of the ACM, 1987
- An algorithm for profile and wavefront reduction of sparse matricesInternational Journal for Numerical Methods in Engineering, 1986
- A Structurally Stable Modification of Hellerman–Rarick’s ${\text{P}}^4 $ Algorithm for Reordering Unsymmetric Sparse MatricesSIAM Journal on Numerical Analysis, 1985
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming basesMathematical Programming, 1982
- Implementation of the Gibbs-Poole-Stockmeyer and Gibbs-King AlgorithmsACM Transactions on Mathematical Software, 1982
- A practicable steepest-edge simplex algorithmMathematical Programming, 1977
- Algorithm 509: A Hybrid Profile Reduction Algorithm [F1]ACM Transactions on Mathematical Software, 1976
- An Algorithm for Reducing the Bandwidth and Profile of a Sparse MatrixSIAM Journal on Numerical Analysis, 1976
- On the Automatic Scaling of Matrices for Gaussian EliminationIMA Journal of Applied Mathematics, 1972