An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations
- 1 May 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 47 (1-3), 175-201
- https://doi.org/10.1007/bf01580859
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling TrajectoriesTransactions of the American Mathematical Society, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- An algorithm for linear programming which requires O(((m+n)nz+(m+n)1n)) arithmetic operationsPublished by Association for Computing Machinery (ACM) ,1987
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967