An unbounded matroid intersection polyhedron
From MaRDI portal
Publication:1244236
Cites work
- A proof of Fulkerson's characterization of permutation matrices
- Blocking and anti-blocking pairs of polyhedra
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- scientific article; zbMATH DE number 3345048 (Why is no real title available?)
- scientific article; zbMATH DE number 3095897 (Why is no real title available?)
- Matroid Intersection
- Matroids and the greedy algorithm
- Optimum branchings
- Packing rooted directed cuts in a weighted directed graph
- Transversal matroid intersections and related packings
Cited in
(7)- Testing membership in matroid polyhedra
- Generalized polymatroids and submodular flows
- On matroid intersections
- Blocking, antiblocking, and pairs of matroids and polymatroids
- On box totally dual integral polyhedra
- Transversal matroid intersections and related packings
- Dominants and submissives of matching polyhedra
This page was built for publication: An unbounded matroid intersection polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1244236)