Blocking pairs of polyhedra arising from network flows
type: Item
instance of: scholarly article
title: Blocking pairs of polyhedra arising from network flows
zbMATH Open document ID: 0315.90071
DOI: 10.1016/0095-8956(75)90052-0
author: D. R. Fulkerson
author: David B. Weinberger
published in: Journal of Combinatorial Theory. Series B
publication date: 1975-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 52A40
Mathematics Subject Classification ID: 52C17
zbMATH DE Number: 3494182
MaRDI profile type: Publication
full work available at URL: 0095-8956(75)90052-0
OpenAlex ID: W2025941642
cites work: Q3292914
cites work: Q5620998
cites work: Anti-blocking polyhedra
cites work: Blocking and anti-blocking pairs of polyhedra
cites work: Packing rooted directed cuts in a weighted directed graph
cites work: A theorem on flows in networks
cites work: Extremal configurations and decomposition theorems. I
cites work: Q3851094
cites work: On a class of capacitated transportation problems
description: scientific article; zbMATH DE number 3494182