An implementation of Karmarkar's algorithm for linear programming
Ilan Adler, Maurício G. C. Resende, Geraldo Veiga et al. · Mathematical Programming · 1989
Cited by 420 works. doi:10.1007/bf01587095
Authors
References
- A new polynomial-time algorithm for linear programming
- Data Structures and Network Algorithms
- Direct Methods for Sparse Matrices
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS
- MINOS 5.0 User's Guide.
- Distribution of mathematical software via electronic mail
- An extension of Karmarkar's algorithm for linear programming using dual variables
- Computing the Minimum Fill-In is NP-Complete
- A modification of karmarkar's linear programming algorithm