Testing membership in matroid polyhedra
- 1 April 1984
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 36 (2) , 161-188
- https://doi.org/10.1016/0095-8956(84)90023-6
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Minimum cuts, modular functions, and matroid polyhedraNetworks, 1985
- A Primal-Dual Algorithm for Submodular FlowsMathematics of Operations Research, 1985
- Finding feasible vectors of Edmonds-Giles polyhedraJournal of Combinatorial Theory, Series B, 1984
- Computing Maximal “Polymatroidal” Network FlowsMathematics of Operations Research, 1982
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- An unbounded matroid intersection polyhedronLinear Algebra and its Applications, 1977
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965