Dominants and submissives of matching polyhedra

DOI10.1007/BF02592027zbMath0616.90056OpenAlexW2041636300MaRDI QIDQ4726052

Jan Green-Krótki, William H. Cunningham

Publication date: 1986

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

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

zbMATH Keywords

dominantmatching polyhedrafacet-inducing inequalityessential valid inequalityperfect matchings of a graph

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Polytopes and polyhedra (52Bxx)

Related Items (5)

Multiflows and disjoint paths of minimum total cost ⋮ Minimum weight \((T,d)\)-joins and multi-joins ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ On the dimension of projected polyhedra ⋮ Tight Cycle Relaxations for the Cut Polytope

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
• 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

This page was built for publication: Dominants and submissives of matching polyhedra