Connected and alternating vectors: Polyhedra and algorithms
- 1 December 1981
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 20 (1) , 233-244
- https://doi.org/10.1007/bf01589348
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Matroid IntersectionAnnals of Discrete Mathematics, 1979
- A Min-Max Relation for Submodular Functions on GraphsPublished by Elsevier ,1977
- A generalization of max flow—min cutMathematical Programming, 1974
- Anti-blocking polyhedraJournal of Combinatorial Theory, Series B, 1972
- Matroids and the greedy algorithmMathematical Programming, 1971