  A covering array CA(N; t; k; v) is an N x k array on v symbols such that
every N x t subarray contains as a row each t-tuple over the v symbols at least
once. The minimum N for which a CA(N; t; k; v) exists is called the covering
array number of t, k, and v, and it is denoted by CAN(t; k; v). In this work we
prove new CANs using an optimized procedure.
