Polynomial algorithms for a class of linear programs
- 1 December 1981
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 21 (1) , 121-136
- https://doi.org/10.1007/bf01584235
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Decomposition of regular matroidsJournal of Combinatorial Theory, Series B, 1980
- Convergence rate of the gradient descent method with dilatation of the spaceCybernetics and Systems Analysis, 1973
- Normal hypergraphs and the perfect graph conjectureDiscrete Mathematics, 1972
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Integral Extreme PointsSIAM Review, 1968
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954