A new algorithm for stable assignment

DOI10.1080/00207169808804620zbMATH Open0890.68069OpenAlexW2008337530MaRDI QIDQ4375407FDOQ4375407

Authors: Mingwen Wang 

Publication date: 5 February 1998

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169808804620

Recommendations

• A new algorithm for stable assignments
• On a new algorithm for stable assignment^*
• scientific article; zbMATH DE number 21745
• Faster algorithms for stable allocation problems
• A new algorithm for the quasi-assignment problem
• Paths to stability in the assignment problem
• A New Approach to Stable Matching Problems
• An algorithm for the assignment problem
• Improved algorithmic results for unsplittable stable allocation problems
• A new algorithm for the assignment problem: An alternative to the Hungarian method

zbMATH Keywords

stable assignment problemstable marriage assignment

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cites Work

• Graph theory with applications
• College Admissions and the Stability of Marriage
• A new algorithm for stable assignments
• On a new algorithm for stable assignment^*

Cited In (5)

• Polynomial time algorithm for an optimal stable assignment with multiple partners
• A new algorithm for stable assignments
• Improved algorithmic results for unsplittable stable allocation problems
• A generation algorithm for the role assigning lattice
• On computing Pareto stable assignments

This page was built for publication: A new algorithm for stable assignment

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