The ellipsoid method and its consequences in combinatorial optimization
- 1 June 1981
- journal article
- research article
- Published by Springer Nature in Combinatorica
- Vol. 1 (2) , 169-197
- https://doi.org/10.1007/bf02579273
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Khachiyan’s algorithm for linear programmingPublished by Springer Nature ,1981
- A counterexample to a conjecture of Edmonds and GilesDiscrete Mathematics, 1980
- Matroid IntersectionAnnals of Discrete Mathematics, 1979
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- Optimum branchingsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Some recent applications of the theory of linear inequalities to extremal combinatorial analysisProceedings of Symposia in Applied Mathematics, 1960
- A note on two problems in connexion with graphsNumerische Mathematik, 1959
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954