Transversal matroid intersections and related packings

DOI10.1007/BF01580384MaRDI QIDQ4126086zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3325507 (Why is no real title available?)
• scientific article; zbMATH DE number 3343715 (Why is no real title available?)
• scientific article; zbMATH DE number 3345048 (Why is no real title available?)
• An unbounded matroid intersection polyhedron
• Blocking and anti-blocking pairs of polyhedra
• Blocking pairs of polyhedra arising from network flows
• Blocking, antiblocking, and pairs of matroids and polymatroids
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• Matroids and the greedy algorithm
• Minimum partition of a matroid into independent subsets
• On the Problem of Decomposing a Graph into n Connected Factors
• Packing rooted directed cuts in a weighted directed graph
• The Maximum Number of Disjoint Permutations Contained in a Matrix of Zeros and Ones
• Transversals and matroid partition

Cited in

(2)

• An unbounded matroid intersection polyhedron
• Integral decomposition in polyhedra

This page was built for publication: Transversal matroid intersections and related packings

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