An algorithm for constructing optimal resolvable incomplete block designs
From MaRDI portal
Publication:4277758
DOI10.1080/03610919308813133zbMath0800.62458OpenAlexW1585009758MaRDI QIDQ4277758
Publication date: 19 January 1994
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610919308813133
optimalityresolvabilityrow-column designsiterative improvementDETMAXregular graph designsalpha-designslattice designs2-interchange
Optimal statistical designs (62K05) Statistical block designs (62K10) Probabilistic methods, stochastic differential equations (65C99)
Related Items (3)
Metaheuristics: A bibliography ⋮ Constructing Efficient Experimental Designs for Generalized Linear Models ⋮ Unfolding incomplete data: guidelines for unfolding row-conditional rank order data with random missings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algebra of a row-column design
- Recursive techniques for the construction of experimental designs
- On the theory of connected designs: Characterization and optimality
- A new measure of overall potential influence in linear regression
- UPPER BOUNDS FOR EFFICIENCY FACTORS IN BLOCK DESIGNS
- Optimality Criteria for Incomplete Block Designs
- COMPUTER-AIDED CONSTRUCTION OF SMALL (M, S)-OPTIMAL INCOMPLETE BLOCK DESIGNS
- A REVIEW OF BOUNDS FOR THE EFFICIENCY FACTOR OF BLOCK DESIGNS
- A NEW UPPER BOUND FOR THE EFFICIENCY FACTOR OF A BLOCK DESIGN
- Construction of Lattice Square Designs
- Simulated annealing: An introduction
- Algorithms for the construction of (M,S)-optimal block designs and row-column designs
- A Simple Construction Procedure for Eesolvable Incomplete Block Designs for any Number of Treatments
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- Connectedness and orthogonality in multi-factor designs
- A new class of resolvable incomplete block designs
- An Algorithm for Deriving Optimal Block Designs
- Generalized cyclic incomplete block designs
- A New Balanced Design for Eighteen Varieties
- RANDOMIZED SEARCH STRATEGIES FOR FINDING OPTIMAL OR NEAR OPTIMAL BLOCK AND ROW‐COLUMN DESIGNS
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A Balanced Design for 18 Varieties
This page was built for publication: An algorithm for constructing optimal resolvable incomplete block designs
