scientific article; zbMATH DE number 3549997
From MaRDI portal
Publication:4124137
Cited in
(12)- A note on an upper bound for the constraints of balancedarrays with strength t
- 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
- 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 some optimal fractional 2^ m factorial designs of resolution V
- Bounds on the number of constraints for balanced arrays of strength t
- J.N. Srivastava and experimental design
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 Q4124137)
