具有成功率约束的最优匹配问题  

Optimal matching problem with constraint of success ratio

作　　者：李巍[1] 郭强[1] 曹华[2] 

机构地区：[1]西北工业大学理学院应用数学系,西安710129 [2]西北工业大学发展计划处,西安710072

出　　处：《计算机工程与应用》2011年第4期33-35,76,共4页Computer Engineering and Applications

摘　　要：通过引入匹配成功率,揭示了现行的稳定匹配有时只能保证一些元素之间配对后成功率很高,而另一些元素之间配对后成功率却很低。提出了一种在保证每一配对都能达到一定成功率前提下,所有配对总成功率最高的最优匹配问题,并且给出了一种基于Floyd算法规则进行求解的迭代算法。It turns out that only some individuals of the available stable matching can be matched with high success ratio,but others are matched with low success ratio when the success ratio of matching is involved.For this reason,the optimal matching problem with the maximal success ratio is proposed on condition that each matching pair can be matched depending on some success ratio.Also,an iterative algorithm based on Floyd algorithm is given to solve this problem.

关 键 词：稳定匹配问题 匹配成功率 最优匹配 FLOYD算法 

分 类 号：O221[理学—运筹学与控制论]