Computational experience with a primal-dual interior point method for linear programming

Interior path following primal-dual algorithms. part I: Linear programming

Renato D. C. Monteiro, Ilan Adler · Mathematical Programming · 1989 · 488 citations

Natural Sciences, Computer Science, Algorithms +11

An implementation of Karmarkar's algorithm for linear programming

Ilan Adler, Maurício G. C. Resende, Geraldo Veiga et al. · Mathematical Programming · 1989 · 422 citations

Business, Computer Science, Algorithms +11

Modification of the minimum-degree algorithm by multiple elimination

Joseph W. H. Liu · ACM Transactions on Mathematical Software · 1985 · 352 citations · Full text

Computing, Computer Science, Algorithms +11

Direct methods for sparse matrices

Andrzej J. Osiadacz · Automatica · 1990 · 327 citations

Computing, Computer Science, Mathematics +16

Analysis of mathematical programming problems prior to applying the simplex algorithm

A. L. Brearley, Gautam Mitra, H. P. Williams · Mathematical Programming · 1975 · 266 citations

Natural Sciences, Mathematics, Algorithms +12