A new linear programming algorithm — better or worse than the Simplex Method?
- 1 September 1980
- journal article
- Published by Springer Nature in The Mathematical Intelligencer
- Vol. 2 (3), 141-146
- https://doi.org/10.1007/bf03023055
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the Shannon capacity of a graphIEEE Transactions on Information Theory, 1979
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- The Factorization of Linear GraphsJournal of the London Mathematical Society, 1947