A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem

DOI10.1016/j.orl.2005.06.004zbMath1133.90382OpenAlexW1969869546MaRDI QIDQ2466594

Robert D. Carr, Ojas Parekh

Publication date: 15 January 2008

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

Full work available at URL: https://doi.org/10.1016/j.orl.2005.06.004

zbMATH Keywords

\(b\)-matchingmatching theorygeneral factorpolyhedral relaxation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• General factors of graphs
• General antifactors of graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Normal hypergraphs and the perfect graph conjecture. (Reprint)
• Paths, Trees, and Flowers
• The factorization of graphs. II
• Unnamed Item
• Unnamed Item

This page was built for publication: A \(\frac{1}{2}\)-integral relaxation for the \(A\)-matching problem