Testing membership in matroid polyhedra
type: Item
instance of: scholarly article
title: Testing membership in matroid polyhedra
zbMATH Open document ID: 0522.90067
DOI: 10.1016/0095-8956(84)90023-6
author: William H. Cunningham
published in: Journal of Combinatorial Theory. Series B
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 52Bxx
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3827587
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: polynomial-time algorithms
zbMATH Keywords: submodular functions
zbMATH Keywords: computational membership determination
zbMATH Keywords: network flows
zbMATH Keywords: matroid partitioning
MaRDI profile type: Publication
full work available at URL: 0095-8956(84)90023-6
OpenAlex ID: W2080656989
cites work: The Partial Order of a Polymatroid Extreme Point
cites work: An unbounded matroid intersection polyhedron
cites work: Minimum cuts, modular functions, and matroid polyhedra
cites work: A Primal-Dual Algorithm for Submodular Flows
cites work: Q5624995
cites work: Minimum partition of a matroid into independent subsets
cites work: Q5684698
cites work: Q4149476
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: Q3929415
cites work: Blocking and anti-blocking pairs of polyhedra
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Q3216686
cites work: Computing Maximal “Polymatroidal” Network Flows
cites work: Preemptive Scheduling with Release Times, Deadlines, and Due Times
cites work: Blocking, antiblocking, and pairs of matroids and polymatroids
cites work: Selected Applications of Minimum Cuts in Networks
cites work: Q4111952
description: scientific article; zbMATH DE number 3827587