On dual integrality in matching problems

DOI10.1016/0167-6377(89)90048-5zbMath1418.90158OpenAlexW2021763067MaRDI QIDQ2314407

William H. Cunningham, Francisco Barahona

Publication date: 22 July 2019

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(89)90048-5

zbMATH Keywords

algorithmsnetworksgraphsmatchingsdual integrality

Mathematics Subject Classification ID

Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reductions to 1–matching polyhedra
• On Odd Cuts and Plane Multicommodity Flows
• Matching, Euler tours and the Chinese postman
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: On dual integrality in matching problems