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
A Searching for Strongly Egalitarian and Sex-Equal Stable Matchings
Authors:
Hoang Huu Viet
440
0
Advances in Intelligent Systems and Computing
:
:
:
https://link.springer.com/chapter/10.1007/978-3-030-19063-7_87
:
1065_c14.A Searching for Strongly Egalitarian and Sex-Equal Stable Matchings.pdf
Publishing year:
2019
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
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
An efficient heuristic algorithm for solving the Student-Project Allocation with preferences over projects
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