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

In a n=8,9 Set Optimal Apporach for Three Counterfeit Coins by A Balance Scale

作　　者：綦明男[1] 茹艳君 

机构地区：[1]临沂师范学院科研处,山东临沂276005 [2]洛阳市第十九中学,河南洛阳471000

出　　处：《洛阳大学学报》2002年第4期18-20,共3页Journal of Luoyang University

摘　　要：组合搜索中有一个带有普遍性的问题,那就是常常用测试装置去寻找一个最优化的搜索过程.本文给出了用一台天平搜索四个坏硬币的最优化过程,并且这四个坏硬币的重量是相等的.一台天平所提供的坏硬币的信息,是通过比较两个由硬币组成集合的重量而获得.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, four counterfeit coins which are known to be heavier the normal coins. The balance scale provides information about the irregulars by comparing the weights of two subset of coins.

关 键 词：最优化过程 坏硬币问题 重量测试 天平 组合搜索 硬币集合 

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