Transversal matroid intersections and related packings

DOI10.1007/BF01580384zbMath0354.90085OpenAlexW1965085017MaRDI QIDQ4126086

David B. Weinberger

Publication date: 1976

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580384

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items

An unbounded matroid intersection polyhedron, Integral decomposition in polyhedra

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Blocking pairs of polyhedra arising from network flows
• An unbounded matroid intersection polyhedron
• Blocking, antiblocking, and pairs of matroids and polymatroids
• On the Problem of Decomposing a Graph into n Connected Factors
• Packing rooted directed cuts in a weighted directed graph
• Transversals and matroid partition
• Minimum partition of a matroid into independent subsets
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• Blocking and anti-blocking pairs of polyhedra
• Matroids and the greedy algorithm
• The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones