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. ACM Journal of Experimental Algorithmics, 11, 2006. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: