page loader
  1. Home
  2. Bài báo khoa học
  3. Chi tiết bài báo
Finding "Optimal" Stable Marriages with Ties via Local Search
Authors: Le Hong Trang, Hoang Huu Viet, TaeChoong Chung
344    0
In Proceeding of the Eighth International Conference on Knowledge and Systems Engineering (KSE2016), Hanoi, Vietnam, October 6-8, 2016.
:     :
: http://ieeexplore.ieee.org/document/7758030/
: c12.Finding_optimal_stable_marriages_with_ties_via_local_search.pdf
Publishing year: 2016
C# programming for Database ApplicationsAn Empirical Local Search for the Stable Marriage ProblemA Bidirectional Local Search for the Stable Marriage ProblemA Searching for Strongly Egalitarian and Sex-Equal Stable MatchingsNgôn ngữ hình thức và AutomataA Max-Min Conflict Algorithm for the Stable Marriage ProblemB-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