An application of simultaneous diophantine approximation in combinatorial optimization
- 1 March 1987
- journal article
- Published by Springer Nature in Combinatorica
- Vol. 7 (1) , 49-65
- https://doi.org/10.1007/bf02579200
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A capacity-rounding algorithm for the minimum-cost circulation problem: A dual framework of the Tardos algorithmMathematical Programming, 1986
- A strongly polynomial minimum cost circulation algorithmCombinatorica, 1985
- Testing membership in matroid polyhedraJournal of Combinatorial Theory, Series B, 1984
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Systems of distinct representatives and linear algebraJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965