An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations
Pravin M. Vaidya · Mathematical Programming · 1990
Cited by 195 works. doi:10.1007/bf01580859
Authors
References
- The algebraic eigenvalue problem
- The Algebraic Eigenvalue Problem
- A new polynomial-time algorithm for linear programming
- Introduction to matrix computations
- Combinatorial Optimization: Algorithms and Complexity.
- Polynomial algorithms in linear programming
- Combinatorial optimization:Algorithms and complexity
- Systems of distinct representatives and linear algebra
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming