A new polynomial-time algorithm for linear programming
Combinatorica
Direct methods for sparse matrices
Direct methods for sparse matrices
Mathematical Programming: Series A and B
A note on comparing simplex and interior methods for linear programming
on Progress in Mathematical Programming: Interior-Point and Related Methods
Pathways to the optimal set in linear programming
on Progress in Mathematical Programming: Interior-Point and Related Methods
Vector processing in simplex and interior methods for linear programming
Annals of Operations Research
Implementing the simplex method for the Optimization Subroutine Library
IBM Systems Journal
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Introduction to the IBM optimization subroutine library
IBM Systems Journal
Recent developments and future directions in mathematical programming
IBM Systems Journal
IBM Journal of Research and Development
| Hi-index | 0.00 |