Complexity of linear programming
- 30 April 1982
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 1 (2) , 59-62
- https://doi.org/10.1016/0167-6377(82)90047-5
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- The Great Mathematical Sputnik of 1979The Sciences, 1980
- A new linear programming algorithm — better or worse than the Simplex Method?The Mathematical Intelligencer, 1980
- Khachiyan's linear programming algorithmJournal of Algorithms, 1980
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- How to Solve Linear InequalitiesThe American Mathematical Monthly, 1969
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967