The Maximum-Weight Stable Matching Problem: Duality and Efficiency

DOI10.1137/120864866zbMath1282.90105OpenAlexW2085721624MaRDI QIDQ4899065

Wenan Zang, Xiao-Dong Hu, Guoli Ding, Xu-jin Chen

Publication date: 4 January 2013

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

Full work available at URL: http://hdl.handle.net/10722/164177

zbMATH Keywords

linear systempolynomial-time algorithmstable matchingtotal dual integralityintegral polytope

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (3)

On the diameter of lattice polytopes ⋮ Marriage market with indifferences: a linear programming approach ⋮ Stable fractional matchings

This page was built for publication: The Maximum-Weight Stable Matching Problem: Duality and Efficiency