An unbounded matroid intersection polyhedron
From MaRDI portal
Publication:1244236
DOI10.1016/0024-3795(77)90003-9zbMath0373.05024OpenAlexW2055666548MaRDI QIDQ1244236
Publication date: 1977
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(77)90003-9
Linear programming (90C05) Combinatorial aspects of matroids and geometric lattices (05B35) Polytopes and polyhedra (52Bxx)
Related Items
On box totally dual integral polyhedra ⋮ Generalized polymatroids and submodular flows ⋮ On matroid intersections ⋮ Transversal matroid intersections and related packings ⋮ Blocking, antiblocking, and pairs of matroids and polymatroids ⋮ Dominants and submissives of matching polyhedra ⋮ Testing membership in matroid polyhedra
Cites Work
- A proof of Fulkerson's characterization of permutation matrices
- Matroid Intersection
- Transversal matroid intersections and related packings
- Packing rooted directed cuts in a weighted directed graph
- Optimum branchings
- Blocking and anti-blocking pairs of polyhedra
- Matroids and the greedy algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item