用一台天平从n=7,9个元素的集合中称量出三个坏硬币的最优化过程  

In a n=7,9 Set Optimal Approach for Three Counterfeit Coins by a Balance Scale

作　　者：陈国华[1] 王守信[2] 

机构地区：[1]临沂师范学院工程学院,山东临沂276005 [2]临沂师范学院数学系,山东临沂276005

出　　处：《洛阳大学学报》2003年第2期10-12,共3页Journal of Luoyang University

基　　金：山东省教育厅科技计划项目(项目编号:J00P55)

摘　　要：组合搜索中有一个带有普遍性的问题,那就是常常用测试装置去寻找一个最优化的搜索过程,本文给出了用一台天平搜索三个坏硬币的最优化过程,并且这三个坏硬币的重量是相等的,一台天平所提供的坏硬币的信息是通过比较两个由硬币组成集合的重量而获得的。A common phenomenon in combinatorial search theory is that while it is often straightforward to find an optimal procedure searching. This paper give an optimal approach by a balance scale sufficient to find, among n coins, three counterfeit coins which are known to be heavier than the normal coins. The balance scale provides information about the irregulars by comparing the weights of two subsets of coins.

关 键 词：坏硬币问题 最优化过程 最优化问题 最优化搜索 组合搜索 硬币集合 

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