Finding feasible vectors of Edmonds-Giles polyhedra
- 1 June 1984
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 36 (3) , 221-239
- https://doi.org/10.1016/0095-8956(84)90029-7
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A Primal-Dual Algorithm for Submodular FlowsMathematics of Operations Research, 1985
- Testing membership in matroid polyhedraJournal of Combinatorial Theory, Series B, 1984
- Minimum cost flow with set‐constraintsNetworks, 1982
- A weighted matroid intersection algorithmJournal of Algorithms, 1981
- Total dual integrality and b-matchingsOperations Research Letters, 1981
- How to make a digraph strongly connectedCombinatorica, 1981
- On total dual integralityLinear Algebra and its Applications, 1981
- Matroid IntersectionAnnals of Discrete Mathematics, 1979
- A Minimax Theorem for Directed GraphsJournal of the London Mathematical Society, 1978
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972