Structural aspects of the student project allocation problem
From MaRDI portal
Cites work
- A class of multipartner matching markets with a strong lattice structure
- A Constraint Programming Approach to the Hospitals / Residents Problem
- A Fixed-Point Approach to Stable Matchings and Some Applications
- A matroid approach to stable matchings with lower quotas
- A new proof of the lattice structure of many-to-many pairwise-stable matchings
- Classified stable matching
- College Admissions and the Stability of Marriage
- scientific article; zbMATH DE number 1617265 (Why is no real title available?)
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 1305096 (Why is no real title available?)
- scientific article; zbMATH DE number 1405659 (Why is no real title available?)
- New algorithms for hierarchical optimization in kidney exchange programs
- Student-project allocation with preferences over projects: algorithmic and experimental results
- The Complexity of Counting Stable Marriages
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- The set of super-stable marriages forms a distributive lattice
- The structure of stable marriage with indifference
- Three Fast Algorithms for Four Problems in Stable Marriage
- Two algorithms for the student-project allocation problem
This page was built for publication: Structural aspects of the student project allocation problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885538)