scientific article; zbMATH DE number 4133845

MaRDI QIDQ3035153zbMATH OpenFDO

Authors Wei Ling Wu

Publication date 1988

zbMATH Keywords

minimum cost stable matchingpolynomial-time algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Recommendations

• The Generalized Stable Allocation Problem
• Stable matchings and linear inequalities
• An efficient algorithm for the “stable roommates” problem
• Stable matchings and linear programming
• On the invariance of male optimal stable matching

Cited in

(10)

• Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties
• Minimum cost perfect matching with delays for two sources
• (Un)stable matchings with blocking costs
• Best optimal stable matching
• The price of matching with metric preferences
• The Generalized Stable Allocation Problem
• scientific article; zbMATH DE number 123780 (Why is no real title available?)
• Optimal matching of approvers to access requests
• A polynomial-time algorithm for a stable matching problem with linear valuations and bounded side payments
• Rotations in the stable b-matching problem

This page was built for publication:

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