Proving total dual integrality with cross-free families—A general framework
type: Item
instance of: scholarly article
title: Proving total dual integrality with cross-free families—A general framework
zbMATH Open document ID: 0531.90076
DOI: 10.1007/BF02591726
published in: Mathematical Programming
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 3843506
zbMATH Keywords: kernel system
zbMATH Keywords: submodular, lattice polyhedra
zbMATH Keywords: polymatroidal network flows
zbMATH Keywords: total dual integrality
zbMATH Keywords: total unimodularity
zbMATH Keywords: cross-free
MaRDI profile type: Publication
cites work: Q4197644
cites work: Q5684698
cites work: Q4149476
cites work: Maximal Flow Through a Network
cites work: Q3859792
cites work: Q3684133
cites work: An Algorithm for Submodular Functions on Graphs
cites work: Q3929415
cites work: ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
cites work: Packing rooted directed cuts in a weighted directed graph
cites work: Optimum matching forests I: Special weights
cites work: Optimum matching forests II: General weights
cites work: Optimum matching forests III: Facets of matching forest polyhedra
cites work: Polyhedra related to a lattice
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: A generalization of max flow—min cut
cites work: Q4194968
cites work: Q4082546
cites work: Computing Maximal “Polymatroidal” Network Flows
cites work: A Minimax Theorem for Directed Graphs
cites work: Min-max Relations for Directed Graphs
cites work: Short proofs on the matching polyhedron
cites work: Q3330974
cites work: Lectures on matroids
cites work: Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
author: Alexander Schrijver
description: scientific article