A “build-down” scheme for linear programming
Data up to Jan 2025
Total Citations Per Year
Abstract
References (19)
Linear Programming and Extensions
1963 • 5,853 citations
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
Linear Programming and Extensions
1963 • 2,647 citations
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
1986 • 439 citations
An implementation of Karmarkar's algorithm for linear programming
1989 • 424 citations
A practicable steepest-edge simplex algorithm
1977 • 208 citations
An extension of Karmarkar's algorithm for linear programming using dual variables
1986 • 153 citations
A monotonic projective algorithm for fractional linear programming
1986 • 109 citations
Utilization of the operation of space dilatation in the minimization of convex functions
1972 • 105 citations
A variant of Karmarkar's linear programming algorithm for problems in standard form
1987 • 95 citations
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
1987 • 78 citations
Conical projection algorithms for linear programming
1989 • 67 citations
Interior Algorithms for Linear, Quadratic, and Linearly Constrained Convex Programming
1997 • 53 citations
An exact update for Harris’ TREAD
1975 • 38 citations
Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
1988 • 34 citations
Karmarkar's algorithm and the ellipsoid method
1987 • 33 citations
Eliminating columns in the simplex method for linear programming
1989 • 28 citations
The Ellipsoid Method Generates Dual Variables
1985 • 22 citations
Ueber das Explosionstrauma des Ohres
1942 • 7 citations