On a new algorithm for stable assignment*
From MaRDI portal
Publication:3989776
Recommendations
Cited in
(8)- A new look at the optimal assignment problem
- A new algorithm for the assignment problem: An alternative to the Hungarian method
- Relationship between matching and assignment problems
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- On computing Pareto stable assignments
- A new algorithm for stable assignments
- Improved algorithmic results for unsplittable stable allocation problems
- A new algorithm for stable assignment
This page was built for publication: On 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 Q3989776)