Pages that link to "Item:Q3989776"
From MaRDI portal
The following pages link to On a new algorithm for stable assignment<sup>*</sup> (Q3989776):
Displaying 8 items.
- Improved algorithmic results for unsplittable stable allocation problems (Q326457) (← links)
- A new look at the optimal assignment problem (Q1057343) (← links)
- A new algorithm for the assignment problem: An alternative to the Hungarian method (Q1374026) (← links)
- Relationship between matching and assignment problems (Q1759191) (← links)
- Polynomial time algorithm for an optimal stable assignment with multiple partners (Q2373720) (← links)
- On computing Pareto stable assignments (Q2904778) (← links)
- A new algorithm for stable assignments (Q3202138) (← links)
- A new algorithm for stable assignment (Q4375407) (← links)