A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques.

Torsten Fahle Karsten Tiemann A faster branch-and-bound algorithm for the test-cover problem based on set-covering techniques. 2006 11 ACM Journal of Experimental Algorithmics http://doi.acm.org/10.1145/1187436.1216579 db/journals/jea/jea11.html#FahleT06