A neural network approach to solve the stable matching problem

DOI10.1016/0377-2217(96)00039-2MaRDI QIDQ1268167zbMATH OpenOpenAlexFDO

Authors Yufei Yuan, Li Wang

Publication date 7 March 1999

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(96)00039-2

zbMATH Keywords

distributed parallel processingmaximum cut-off neuronmaximum selection neuronstable matching problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Recommendations

• A New Approach to Stable Matching Problems
• High Performance Computing - HiPC 2003
• Nash equilibrium in stable matching problems
• A sublinear parallel algorithm for stable matching
• Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties

Cites work

• ``Neural computation of decisions in optimization problems
• A Generalization of the Stable Marriage Problem
• A parallel algorithm to solve the stable marriage problem
• College Admissions and the Stability of Marriage
• scientific article; zbMATH DE number 45086 (Why is no real title available?)
• scientific article; zbMATH DE number 50262 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Recurrent neural networks for linear programming: Analysis and design principles
• The average performance of a parallel stable mariage algorithm
• Worst-case choice for the stable marriage problem

This page was built for publication: A neural network approach to solve the stable matching problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268167)