Methods to Construct Uniform Covering Arrays

Uniform covering arrays are covering arrays in which every column has the same alphabet. In recent years, a number of methods to construct such arrays have been developed. Here, we review several of these methods organizing them into six classes: algebraic, recursive, exact, greedy, metaheuristic, and transformations. The objective of this paper is to highlight the strategy of some representative algorithms of each class. Most of the reviewed methods are accompanied by examples and/or pseudocodes. This paper ends with a discussion about the general strengths and weaknesses of each class of methods.