Chrome Extension
WeChat Mini Program
Use on ChatGLM

A Heuristic Repair Algorithm for the Maximum Stable Marriage Problem with Ties and Incomplete Lists

AI 2021: ADVANCES IN ARTIFICIAL INTELLIGENCE(2022)

Cited 1|Views6
Abstract
This paper proposes a heuristic repair algorithm to find a maximum weakly stable matching for the stable marriage problem with ties and incomplete lists. Our algorithm is designed including a well-known Gale-Shapley algorithm to find a stable matching for the stable marriage problem with ties and incomplete lists and a heuristic repair function to improve the found stable matching in terms of maximum size. Experimental results for large randomly generated instances of the problem showed that our algorithm is efficient in terms of both execution time and solution quality for solving the problem.
More
Translated text
Key words
Gale-Shapley algorithm, Heuristic repair, SMTI, Stable marriage problem
求助PDF
上传PDF
Bibtex
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper
Summary is being generated by the instructions you defined