Back to search
On the convexity of the multiplicative version of Karmarkar's potential function
Data up to Jan 2025
Published1988
Citations24
References4
Total Citations Per Year
Abstract
References (4)
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
An extension of Karmarkar's algorithm for linear programming using dual variables
1986 • 153 citations
On the complexity of linear programming
1987 • 139 citations
A multiplicative barrier function method for linear programming
1986 • 79 citations
Cited By (0)
Loading...