A new algorithm for stable assignments

DOI10.1080/00207169008803918MaRDI QIDQ3202138zbMATH OpenOpenAlexFDO

Authors Yiadong Huang, Shu Park Chan

Publication date 1990

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

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

zbMATH Keywords

stable marriagestable assignmentmulti-function assignments

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09) Discrete location and assignment (90B80)

Recommendations

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

Cites work

• College Admissions and the Stability of Marriage
• Stable marriage assignment for unequal sets
• The stability of marriage and university admissions—zero-one programming method

Cited in

(6)

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

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

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