Article1993

AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW‐COLUMN DESIGNS

46 citations0/0 files storedAustralian Journal of Statistics

No readable copy stored yet — this record is metadata only.

Optimal Experimental Design Methods Advanced Combinatorial Mathematics Statistical Methods in Clinical Trials

Abstract

Summary This paper describes an effective algorithm for constructing optimal or near‐optimal resolvable row‐column designs (RCDs) with up to 100 treatments. The performance of this algorithm is assessed against 20 2‐replicate resolvable RCDs of Patterson & Robinson (1989) and 17 resolvable RCDs based on generalized cyclic designs (GCDs) of Ipinyomi & John (1985). The use of the algorithm to construct RCDs with contiguous replicates is discussed.

Citations in this library

Stored only when both papers are in the corpus — 46 citations exist upstream.

References

1976A New Class of Resolvable Incomplete Block Designs 2000An Algorithm for the Construction of "D-Optimal" Experimental Designs 1974An Algorithm for the Construction of "D-Optimal" Experimental Designs 1992A review of some exchange algorithms for constructing discrete D-optimal designs 1974On the Theory of Connected Designs: Characterization and Optimality 1980Exchange and Interchange Procedures to Search for Optimal Designs 1975Connectedness and Orthogonality in Multi-Factor Designs 1940Lattice squares

Imported from OpenAlex (CC0) — nothing here is generated.