Graph-theoretic techniques in D-optimal design problems (Q1598699): Difference between revisions

@@ Property / cites work @@
+E-optimal 2<sup>k</sup>saturated designs
@@ Property / cites work: E-optimal 2<sup>k</sup>saturated designs / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal block designs with minimal number of observations
+Normal rank
@@ Property / cites work @@
+Optimal a\(\times b\) connected designs with \(a+b\) observations
+Normal rank
@@ Property / cites work @@
+Q4894995
@@ Property / cites work: Q4894995 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Matching theory
@@ Property / cites work: Matching theory / rank @@
+Normal rank
@@ Property / cites work @@
+Uncertain Resources and Optimal Designs : Problems and Perspectives
+Normal rank
@@ Property / cites work @@
+D–optimality of a class of saturated main–effect plans and allied results
+Normal rank
@@ Property / cites work @@
+\(E\)-optimal minimally connected block designs under mixed effects model
+Normal rank
@@ Property / cites work @@
+Almost saturated D-optimal main effect plans and allied results
+Normal rank
@@ Property / cites work @@
+Matching is as easy as matrix inversion
@@ Property / cites work: Matching is as easy as matrix inversion / rank @@
+Normal rank