Dominants and submissives of matching polyhedra
From MaRDI portal
Publication:4726052
DOI10.1007/BF02592027zbMath0616.90056MaRDI QIDQ4726052
William H. Cunningham, Jan Green-Krótki
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
dominant; matching polyhedra; facet-inducing inequality; essential valid inequality; perfect matchings of a graph
90C27: Combinatorial optimization
05B35: Combinatorial aspects of matroids and geometric lattices
52Bxx: Polytopes and polyhedra
Related Items
On the dimension of projected polyhedra, Multiflows and disjoint paths of minimum total cost, Minimum weight \((T,d)\)-joins and multi-joins
Cites Work
- Blocking pairs of polyhedra arising from network flows
- An unbounded matroid intersection polyhedron
- Blocking, antiblocking, and pairs of matroids and polymatroids
- Network Flows, Minimum Coverings, and the Four-Color Conjectures
- Maximum matching and a polyhedron with 0,1-vertices
- Blocking and anti-blocking pairs of polyhedra
- Unnamed Item
- Unnamed Item
- Unnamed Item