Blocking pairs of polyhedra arising from network flows
Authors:
- D.R FulkersonDFD.R Fulkerson
- David B WeinbergerDWDavid B Weinberger
- 1 June 1975
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 18 (3) , 265-283
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Packing rooted directed cuts in a weighted directed graphMathematical Programming, 1974
- Anti-blocking polyhedraJournal of Combinatorial Theory, Series B, 1972
- Blocking and anti-blocking pairs of polyhedraMathematical Programming, 1971
- Extremal configurations and decomposition theorems. IJournal of Algebra, 1968
- Combinatorial Mathematics1963
- On a Class of Capacitated Transportation ProblemsManagement Science, 1959
- A theorem on flows in networksPacific Journal of Mathematics, 1957