Minimal cost flows in regular matroids
- 1 January 1981
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Algebraic flows in regular matroidsDiscrete Applied Mathematics, 1980
- A general Hungarian method for the algebraic transportation problemDiscrete Mathematics, 1978
- The matroids with the max-flow min-cut propertyJournal of Combinatorial Theory, Series B, 1977
- More pathological examples for network flow problemsMathematical Programming, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Modules unimodulairesJournal of Combinatorial Theory, 1968
- A Homotopy Theorem for Matroids, ITransactions of the American Mathematical Society, 1958