Local Unimodularity in the Matching Polytope

DOI10.1016/S0167-5060(08)70333-9zbMath0398.90064MaRDI QIDQ4182243

R. Oppenheim, Alan J. Hoffman

Publication date: 1978

Published in: Algorithmic Aspects of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

MatricesLocal UnimodularityMatching Polytope

Mathematics Subject Classification ID

Linear programming (90C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory to circuits and networks (94C15) Polytopes and polyhedra (52Bxx)

Related Items (12)

Polyhedral proof methods in combinatorial optimization ⋮ Scaling: A general framework ⋮ An algorithmic approach to dual integrality of matching and extensions ⋮ Complement total unimodularity ⋮ Total dual integrality implies local strong unimodularity ⋮ A matching problem with side conditions ⋮ Implementation of a unimodularity test ⋮ Total dual integrality and b-matchings ⋮ Box-total dual integrality, box-integrality, and equimodular matrices ⋮ Local unimodularity of matrix-vector pairs ⋮ A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron ⋮ A note on matchings and separability

This page was built for publication: Local Unimodularity in the Matching Polytope