VinhUni
Home
Message
Scientists
Articles
Projects
Textbooks
News
Dashboard
Tiếng việt
Bài báo khoa học
Home
Bài báo khoa học
Chi tiết bài báo
An efficient heuristic algorithm for solving the Student-Project Allocation with preferences over projects
Authors:
Nguyen Thi Uyen, Nguyen Long Giang, Tran Xuan Sang, Hoang Huu Viet
333
0
:
1
:
25-30
:
1065-c22.pdf
Publishing year:
12/2021
C# programming for Database Applications
An Empirical Local Search for the Stable Marriage Problem
Finding "Optimal" Stable Marriages with Ties via Local Search
A Bidirectional Local Search for the Stable Marriage Problem
A Searching for Strongly Egalitarian and Sex-Equal Stable Matchings
Ngôn ngữ hình thức và Automata
A Max-Min Conflict Algorithm for the Stable Marriage Problem
B-Theta*: an Efficient Online Coverage Algorithm for Autonomous Cleaning Robots
Univector field method-based multi-agent navigation for pursuit problem in obstacle environments
A min-conflicts algorithm for maximum stable matchings of the hospitals/residents problem with ties
A shortlist-based bidirectional local search for the stable marriage problem
Optimally stable matchings for resource allocations
A max-conflicts-based heuristic search for the stable marriage problem with ties and incomplete lists
A Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete Lists
A Heuristic Repair Algorithm for the Hospitals/Residents Problem with Ties
An approximate search algorithm for the student-internship allocation problem
An Improved AdaBoost Algorithm for Highly Imbalanced Datasets in the Co-Authorship Recommendation Problem
Finding Maximum Weakly Stable Matchings for Hospitals/Residents with Ties Problem via Heuristic Search