A note on matchings and separability

DOI10.1016/0166-218X(85)90013-7zbMATH Open0558.90068MaRDI QIDQ802467FDOQ802467

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)

Cites Work

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

Cited In (4)

• Total dual integrality of matching forest constraints
• A theorem on the principal structure for independent matchings
• A note on Banach's match box problem
• Structural properties of matroid matchings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q802467)