Linear Systems for Constrained Matching Problems

DOI10.1287/MOOR.12.1.97MaRDI QIDQ3752421zbMATH OpenOpenAlexFDO

Authors William R. Pulleyblank, William Cook

Publication date 1987

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.12.1.97

zbMATH Keywords

convex hullmatchingsminimal systems

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Operations research and management science (90B99)

Recommendations

• A note on matchings and separability
• scientific article; zbMATH DE number 1953187
• b-matching degree-sequence polyhedra
• Total dual integrality of matching forest constraints
• Reducing Matching to Polynomial Size Linear Programming

Cited in

(16)

• A polyhedral approach for a constrained matching problem
• The Schrijver system of odd join polyhedra
• A maximum b-matching problem arising from median location models with applications to the roommates problem
• The minimum spanning \(k\)-core problem with bounded CVaR under probabilistic edge failures
• Total dual integrality implies local strong unimodularity
• Constrained multi-object auctions and b-matching
• When is the matching polytope box-totally dual integral?
• Two-lattice polyhedra: Duality and extreme points
• The Schrijver system of the length polyhedron of an interval order
• A network structural approach to the link prediction problem
• The Schrijver system of the flow cone in series-parallel graphs
• Structural properties of matroid matchings
• A note on matchings and separability
• Packing $k$-Matchings and $k$-Critical Graphs
• Finding triangle-free 2-factors in general graphs
• An algorithmic approach to dual integrality of matching and extensions

This page was built for publication: Linear Systems for Constrained Matching Problems

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