A note on matchings and separability

DOI10.1016/0166-218X(85)90013-7zbMath0558.90068MaRDI QIDQ802467

William Cook

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

separabilityindependence systemsmatching polytopeminimal totally dual integral systems

Mathematics Subject Classification ID

Integer programming (90C10) Polytopes and polyhedra (52Bxx)

Related Items (1)

Structural properties of matroid matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Total dual integrality and integer polyhedra
• Short proofs on the matching polyhedron
• On total dual integrality
• Total dual integrality and b-matchings
• The ellipsoid method and its consequences in combinatorial optimization
• A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
• Linear Systems for Constrained Matching Problems
• Dual integrality in b-matching problems
• Local Unimodularity in the Matching Polytope
• Maximum matching and a polyhedron with 0,1-vertices
• Matroids and the greedy algorithm

This page was built for publication: A note on matchings and separability