Blocking pairs of polyhedra arising from network flows

DOI10.1016/0095-8956(75)90052-0zbMath0315.90071OpenAlexW2025941642MaRDI QIDQ1221561

D. R. Fulkerson, David B. Weinberger

Publication date: 1975

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(75)90052-0

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

On assignment functions, Dynamic decomposition method for linear programming problems with ceneralized upper bounds, Packing and covering with integral feasible flows in integral supply-demand networks, Transversal matroid intersections and related packings, A proof of Fulkerson's characterization of permutation matrices, Dominants and submissives of matching polyhedra, Integral decomposition in polyhedra, Integer Rounding for Polymatroid and Branching Optimization Problems

Cites Work

• A theorem on flows in networks
• Extremal configurations and decomposition theorems. I
• Anti-blocking polyhedra
• On a Class of Capacitated Transportation Problems
• Packing rooted directed cuts in a weighted directed graph
• Blocking and anti-blocking pairs of polyhedra
• Unnamed Item
• Unnamed Item
• Unnamed Item