AN ALGORITHM FOR CONSTRUCTING OPTIMAL RESOLVABLE ROW‐COLUMN DESIGNS
- 1 September 1993
- journal article
- Published by Wiley in Australian Journal of Statistics
- Vol. 35 (3) , 363-370
- https://doi.org/10.1111/j.1467-842x.1993.tb01344.x
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.Keywords
This publication has 28 references indexed in Scilit:
- RANDOMIZED SEARCH STRATEGIES FOR FINDING OPTIMAL OR NEAR OPTIMAL BLOCK AND ROW‐COLUMN DESIGNSAustralian Journal of Statistics, 1993
- CONSTRUCTION OF RESOLVABLE ROW‐COLUMN DESIGNS USING SIMULATED ANNEALINGAustralian Journal of Statistics, 1993
- UPPER BOUNDS FOR LATINIZED DESIGNSAustralian Journal of Statistics, 1993
- Bounds for the efficiency factor of row-column designsBiometrika, 1992
- A REVIEW OF BOUNDS FOR THE EFFICIENCY FACTOR OF BLOCK DESIGNSAustralian Journal of Statistics, 1989
- Row-and-column designs with two replicatesThe Journal of Agricultural Science, 1989
- Nested generalized cyclic row-column designsBiometrika, 1985
- UPPER BOUNDS FOR EFFICIENCY FACTORS IN BLOCK DESIGNSAustralian Journal of Statistics, 1977
- An Algorithm for Deriving Optimal Block DesignsTechnometrics, 1976
- An Algorithm for Deriving Optimal Block DesignsTechnometrics, 1976