A penalty-based Tabu search for constrained covering arrays
Philippe Galinier, Sègla Kpodjedo, Giulio Antoniol · Proceedings of the Genetic and Evolutionary Computation Conference · 2017
Combinatorial Interaction Testing is a black-box testing technique particularly used for highly configurable software systems, which involve a number of factors (and values) that can be combined, according to some constraints. In this context, constrained covering array (CCA) is a central combinatorial problem tasked with building a test suite of minimum size and maximum coverage of the factors' interactions.