In the test cover problem a set of items is given together with a collection of subsets of the items, called tests. A smallest subcollection of tests is to be selected such that for every pair of items there is a test in the selection that contains exactly one of the two items. This problem is NP-hard in general. It has important applications in biology, pharmacy, and the medical sciences, as well as in coding theory.
We develop a variety of branch-and-bound algorithms to solve the problem to optimality. The variety is in the de.nition of the branching rules and the lower bounds to prune the search tree. Our algorithms are compared both theoretically and empirically.
|Title of host publication||Algorithms - ESA 2002 (Proceedings 10th Annual European Symposium, Rome, Italy, September 17-21, 2002)|
|Editors||R. Möhring, R. Raman|
|Place of Publication||Berlin|
|Publication status||Published - 2002|
|Name||Lecture Notes in Computer Science|