A Min-Max Theorem for a Constrained Matching Problem

DOI10.1137/S0895480195280538MaRDI QIDQ4337736zbMATH OpenFDO

Authors Andreas Hefner

Publication date 26 May 1997

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

polyhedral combinatoricsmin-max relationsconstrained matching problem

Mathematics Subject Classification ID

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

Recommendations

• On min-max theorems in matching theory
• An optimal matching problem with constraints
• The minimum maximal k-partial-matching problem
• The constrained minimax linear assignment problem
• A polyhedral approach for a constrained matching problem
• Approximability results for the maximum and minimum maximal induced matching problems
• Tight bounds on maximal and maximum matchings
• scientific article; zbMATH DE number 2081000
• The minimum cost perfect matching problem with conflict pair constraints
• A constrained matching problem

Cited in

(4)

• A polyhedral approach for a constrained matching problem
• A constrained independent set problem for matroids
• A constrained matching problem
• Equivalence between the minimum covering problem and the maximum matching problem

This page was built for publication: A Min-Max Theorem for a Constrained Matching Problem

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