Finding Maximum Stable Matchings for the Student-Project Allocation Problem with Preferences Over Projects
Tác giả: Hoang Huu Viet, Le Van Tan, Son Thanh Cao
Communications in Computer and Information
Quyển: 1306 Trang: 411-422
Năm xuất bản: 11/2020
Tóm tắt
This paper proposes an efficient algorithm to find a maximum weakly stable matching for the Student-Project Allocation Problem with Preferences over Projects.
Từ khóa
Student-Project Allocation Problem, Matching problem, Stable matching, Blocking pair, Local search
