An algorithm for constructing optimal resolvable incomplete block designs
From MaRDI portal
Cites work
- A Balanced Design for 18 Varieties
- A New Balanced Design for Eighteen Varieties
- A new class of resolvable incomplete block designs
- A new measure of overall potential influence in linear regression
- A NEW UPPER BOUND FOR THE EFFICIENCY FACTOR OF A BLOCK DESIGN
- A REVIEW OF BOUNDS FOR THE EFFICIENCY FACTOR OF BLOCK DESIGNS
- A Simple Construction Procedure for Eesolvable Incomplete Block Designs for any Number of Treatments
- Algebra of a row-column design
- Algorithms for the construction of (M,S)-optimal block designs and row-column designs
- An Algorithm for Deriving Optimal Block Designs
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- COMPUTER-AIDED CONSTRUCTION OF SMALL (M, S)-OPTIMAL INCOMPLETE BLOCK DESIGNS
- Connectedness and orthogonality in multi-factor designs
- Construction of Lattice Square Designs
- Generalized cyclic incomplete block designs
- scientific article; zbMATH DE number 4008394 (Why is no real title available?)
- scientific article; zbMATH DE number 3772794 (Why is no real title available?)
- scientific article; zbMATH DE number 45788 (Why is no real title available?)
- On the theory of connected designs: Characterization and optimality
- Optimality Criteria for Incomplete Block Designs
- RANDOMIZED SEARCH STRATEGIES FOR FINDING OPTIMAL OR NEAR OPTIMAL BLOCK AND ROW‐COLUMN DESIGNS
- Recursive techniques for the construction of experimental designs
- Simulated annealing: An introduction
- UPPER BOUNDS FOR EFFICIENCY FACTORS IN BLOCK DESIGNS
Cited in
(4)
This page was built for publication: An algorithm for constructing optimal resolvable incomplete block designs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277758)