Blocking pairs of polyhedra arising from network flows

DOI10.1016/0095-8956(75)90052-0MaRDI QIDQ1221561zbMATH OpenOpenAlexFDO

Authors 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

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

Cites work

• A theorem on flows in networks
• Anti-blocking polyhedra
• Blocking and anti-blocking pairs of polyhedra
• Extremal configurations and decomposition theorems. I
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3345048 (Why is no real title available?)
• On a class of capacitated transportation problems
• Packing rooted directed cuts in a weighted directed graph

Cited in

(8)

• A proof of Fulkerson's characterization of permutation matrices
• Integer Rounding for Polymatroid and Branching Optimization Problems
• 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
• Dominants and submissives of matching polyhedra
• Integral decomposition in polyhedra

This page was built for publication: Blocking pairs of polyhedra arising from network flows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1221561)