摘要
在前人研究成果的基础上,给出用无砝码天平从10个硬币中搜索4枚坏硬币的最优搜索方法.
In this paper, we give a solution to the problem of testing 4 defectives from 10 items. The algorithm used in this paper is sharp, since in telling out the defectives from the good ones, the number of the testing times is minimal.
出处
《数学的实践与认识》
CSCD
北大核心
2009年第4期184-188,共5页
Mathematics in Practice and Theory
基金
国家自然科学基金(1067116660673101)
关键词
分组测试
组合优化
坏硬币问题
group testing
combinatorial optimization
defective dement problem
