Packing and covering with integral feasible flows in integral supply-demand networks
- 1 October 1987
- journal article
- research article
- Published by Springer Nature in Mathematical Programming
- Vol. 39 (3) , 231-239
- https://doi.org/10.1007/bf02592074
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Optimal attack and reinforcement of a networkJournal of the ACM, 1985
- Fractional covers for forests and matchingsMathematical Programming, 1984
- Testing membership in matroid polyhedraJournal of Combinatorial Theory, Series B, 1984
- Integer Rounding for Polymatroid and Branching Optimization ProblemsSIAM Journal on Algebraic Discrete Methods, 1981
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Decomposition of regular matroidsJournal of Combinatorial Theory, Series B, 1980
- Symmetric blocking and anti-blocking relations for generalized circulationsPublished by Springer Nature ,1978
- Blocking pairs of polyhedra arising from network flowsJournal of Combinatorial Theory, Series B, 1975
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965