Two algorithms for the Student-Project Allocation problem

@article{Abraham2007TwoAF,
  title={Two algorithms for the Student-Project Allocation problem},
  author={David J. Abraham and Robert W. Irving and David Manlove},
  journal={J. Discrete Algorithms},
  year={2007},
  volume={5},
  pages={73-90}
}
We study the Student-Project Allocation problem (SPA), a generalisation of the classical Hospitals / Residents problem (HR). An instance of SPA involves a set of students, projects and lecturers. Each project is offered by a unique lecturer, and both projects and lecturers have capacity constraints. Students have preferences over projects, whilst lecturers have preferences over students. We present two optimal linear-time algorithms for allocating students to projects, subject to the preference… CONTINUE READING

From This Paper

Topics from this paper.
34 Citations
23 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 23 references

A constraint programming approach to the student-project allocation problem

  • M. Thorn
  • BSc Honours project report, University of York…
  • 2003
1 Excerpt

Algorithmics of two-sided matching problems

  • D. J. Abraham
  • Master’s thesis, University of Glasgow…
  • 2003
2 Excerpts

Co-ordination of student-project allocation

  • D. Kazakov
  • Manuscript, University of York, Department of…
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…