page loader
  1. Home
  2. Bài báo khoa học
  3. Chi tiết bài báo
A Max-Min Conflict Algorithm for the Stable Marriage Problem
Authors: Hoang Huu Viet
433    0
Lecture Notes in Computer Science
:     :
: https://link.springer.com/chapter/10.1007/978-3-030-30639-7_5
: 1065-c15.pdf
Publishing year: 2019
C# programming for Database ApplicationsAn Empirical Local Search for the Stable Marriage ProblemFinding "Optimal" Stable Marriages with Ties via Local SearchA Bidirectional Local Search for the Stable Marriage ProblemA Searching for Strongly Egalitarian and Sex-Equal Stable MatchingsNgôn ngữ hình thức và AutomataB-Theta*: an Efficient Online Coverage Algorithm for Autonomous Cleaning RobotsUnivector field method-based multi-agent navigation for pursuit problem in obstacle environmentsA min-conflicts algorithm for maximum stable matchings of the hospitals/residents problem with tiesA shortlist-based bidirectional local search for the stable marriage problemOptimally stable matchings for resource allocationsA max-conflicts-based heuristic search for the stable marriage problem with ties and incomplete listsAn efficient heuristic algorithm for solving the Student-Project Allocation with preferences over projectsA Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete ListsA Heuristic Repair Algorithm for the Hospitals/Residents Problem with TiesAn approximate search algorithm for the student-internship allocation problemAn Improved AdaBoost Algorithm for Highly Imbalanced Datasets in the Co-Authorship Recommendation ProblemFinding Maximum Weakly Stable Matchings for Hospitals/Residents with Ties Problem via Heuristic Search