Blocking and anti-blocking pairs of polyhedra
- 1 December 1971
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 1 (1) , 168-194
- https://doi.org/10.1007/bf01584085
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Bottleneck extremaJournal of Combinatorial Theory, 1970
- Maximum matching and a polyhedron with 0,1-verticesJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Lehmans switching game and a theorem of Tutte and Nash-WilliamsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and OnesCanadian Journal of Mathematics, 1964
- Multi-Commodity Network FlowsOperations Research, 1963
- The extremal length of a networkJournal of Mathematical Analysis and Applications, 1962
- On the Problem of Decomposing a Graph into n Connected FactorsJournal of the London Mathematical Society, 1961
- A Decomposition Theorem for Partially Ordered SetsAnnals of Mathematics, 1950