scientific article; zbMATH DE number 3461365

Cited in

(17)

On the characteristic polynomial of the information matrix of balanced fractional \(s^ m\) factorial designs for resolution \(V_{p,q}\)
Search designs for 2^ m factorials derived from balanced arrays of strength 2( +1) and AD-optimal search designs
Robustness of balanced fractional \(2^ m\) factorial designs derived from simple arrays
Fractional factorial designs of two and three levels
2ᵐ fractional factorial designs of resolution V with high A-efficiency, 7 m 10
Alias balanced and alias partially balanced fractional 2^ m factorial
More precise tables of optimal balanced \(2^ m\) fractional factorial designs of Srivastava and Chopra, 7\(\leq m\leq 10\)
Weighted A-optimality for fractional 2ᵐ factorial designs of resolution V
A-optimal partially balanced fractional \(2^{m_ 1+m_ 2}\) factorial designs of resolution V, with \(4\leq m_ 1+m_ 2\leq 6\)
On the robustness of balanced fractional \(2^ m\) factorial designs of resolution \(2l+1\) in the presence of outliers
On robustness of optimal balanced resolution V plans
On some optimal fractional 2^ m factorial designs of resolution V
Balanced arrays of strength 4 and balanced fractional \(3^m\) factorial designs
Characteristic polynomials of the information matrices of balanced fractional \(3^ m\) factorial designs of resolution V
Bounds on the number of constraints for balanced arrays of strength t
J.N. Srivastava and experimental design
On the robustness of the optimum balanced 2^ m factorial designs of resolution V (given by Srivastava and Chopra) in the presence of outliers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4046984)