Comments on “Constraint models for the covering test problem”

Earlier versions of this work were presented at workshops in 2004–5 and the final version was published in the Constraints journal in 2006. In our paper we applied CP and SAT methods to the problem of finding covering arrays, which are combinatorial objects used to reduce the number of trials in testing applications. We were able to prove the optimality of some existing bounds and to find some improved solutions.