An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations
Data up to Jan 2025
Total Citations Per Year
Abstract
References (16)
Combinatorial Optimization: Algorithms and Complexity.
1984 • 6,247 citations
The algebraic eigenvalue problem
1965 • 5,953 citations
The Algebraic Eigenvalue Problem
1966 • 5,231 citations
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
Combinatorial optimization:Algorithms and complexity
1984 • 3,523 citations
Introduction to matrix computations
1973 • 2,448 citations
Polynomial algorithms in linear programming
1980 • 2,063 citations
A polynomial-time algorithm, based on Newton's method, for linear programming
1988 • 587 citations
Systems of distinct representatives and linear algebra
1967 • 390 citations
An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
2006 • 359 citations
An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations
1989 • 204 citations
The nonlinear geometry of linear programming. I. Affine and projective scaling trajectories
1989 • 186 citations
Mathematical Programming Methods
1977 • 101 citations
An algorithm for linear programming which requires O(((m+n)nz+(m+n)1n)) arithmetic operations
1987 • 79 citations
Mathematical Programming Methods
1977 • 60 citations
The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
1989 • 34 citations