A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200): Difference between revisions

@@ Property / cites work @@
+Orthogonal Arrays of Index Unity
@@ Property / cites work: Orthogonal Arrays of Index Unity / rank @@
+Normal rank
@@ Property / cites work @@
+Strength two covering arrays: existence tables and projection
+Normal rank
@@ Property / cites work @@
+Asymptotic and constructive methods for covering perfect hash families and covering arrays
+Normal rank
@@ Property / cites work @@
+Products of mixed covering arrays of strength two
@@ Property / cites work: Products of mixed covering arrays of strength two / rank @@
+Normal rank
@@ Property / cites work @@
+Two applications (for search theory and truth functions) of Sperner type theorems
+Normal rank
@@ Property / cites work @@
+Families of \(k\)-independent sets
@@ Property / cites work: Families of \(k\)-independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Partial covering arrays: algorithms and asymptotics
+Normal rank
@@ Property / cites work @@
+Covering arrays of higher strength from permutation vectors
+Normal rank
@@ Property / cites work @@
+A two-stage algorithm for combinatorial testing
@@ Property / cites work: A two-stage algorithm for combinatorial testing / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu search for covering arrays using permutation vectors
+Normal rank