A two-stage algorithm for combinatorial testing (Q519759): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-016-1012-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2264298794
@@ Property / OpenAlex ID: W2264298794 / rank @@
+Normal rank
@@ Property / cites work @@
+Orthogonal Arrays of Index Unity
@@ Property / cites work: Orthogonal Arrays of Index Unity / rank @@
+Normal rank
@@ Property / cites work @@
+On the state of strength-three covering arrays
@@ Property / cites work: On the state of strength-three covering arrays / rank @@
+Normal rank
@@ Property / cites work @@
+Covering arrays from cyclotomy
@@ Property / cites work: Covering arrays from cyclotomy / rank @@
+Normal rank
@@ Property / cites work @@
+Constructing strength three covering arrays with augmented annealing
+Normal rank
@@ Property / cites work @@
+Covering arrays and intersecting codes
@@ Property / cites work: Covering arrays and intersecting codes / rank @@
+Normal rank
@@ Property / cites work @@
+Roux-type constructions for covering arrays of strengths three and four
+Normal rank
@@ Property / cites work @@
+Group construction of covering arrays
@@ Property / cites work: Group construction of covering arrays / rank @@
+Normal rank
@@ Property / cites work @@
+Q3374252
@@ Property / cites work: Q3374252 / rank @@
+Normal rank
@@ Property / cites work @@
+Tabu search for covering arrays using permutation vectors
+Normal rank