Article ID: | iaor201526016 |
Volume: | 229 |
Issue: | 1 |
Start Page Number: | 265 |
End Page Number: | 286 |
Publication Date: | Jun 2015 |
Journal: | Annals of Operations Research |
Authors: | Du Ding-Zhu, Zheng Feifeng, Cheng Yongxi |
Keywords: | testing, combinatorial optimization |
In many fault detection problems, we want to identify all defective items from a sample set of items using the minimum number of tests. Group testing is for the scenario where each test is performed on a subset of items, and tells whether the subset contains at least one defective item or not. In practice, the number of defective items in the sample set is usually unknown. In this paper, we investigate new algorithms for the group testing problem with unknown number of defective items. We consider the scenario where the performance of a group testing algorithm is measured by two criteria: the primary criterion is the number of tests performed, which measures the total cost spent; and the secondary criterion is the number of stages the algorithm works in, which is referred to as the