The use of treatment concurrences to assess robustness of binary block designs against the loss of whole blocks
From MaRDI portal
Publication:2804155
Recommendations
- Improved conditions for the robustness of binary block designs against the loss of whole blocks
- The robustness of resolvable block designs against the loss of whole blocks or replicates
- Conditions for the robustness of block designs against the unavailability of data
- Some more robust block designs against the unavailability of data
- Most robust BIBDs
Cites work
- scientific article; zbMATH DE number 3305586 (Why is no real title available?)
- A cyclic method of constructing regular group divisible incomplete block designs
- A method of construction of regular group divisible designs
- A note on robustness of D-optimal block designs for two-colour microarray experiments
- Combinatorial Properties of Group Divisible Incomplete Block Designs
- Composite construction of group divisible designs
- Conditions for the robustness of block designs against the unavailability of data
- Construction of regular group divisible designs
- Efficient design and analysis of two colour factorial microarray experiments
- Equireplicate balanced block designs with unequal block sizes
- Generalizing Clatworthy group divisible designs
- Group divisible designs with block size four and two groups
- Improved conditions for the robustness of binary block designs against the loss of whole blocks
- Minimum breakdown designs in blocks of size two
- New constructions of group divisible designs
- On a robustness property of PBIBD
- On the theory of connected designs: Characterization and optimality
- Optimality of certain asymmetrical experimental designs
- Optimality of some two-associate-class partially balanced incomplete- block designs
- Robustness of BIBD against the unavailability of data
- Simple Pilot Procedures for the Avoidance of Disconnected Experimental Designs
- Some Incomplete Block Designs of Maximum Efficiency
- Some more robust block designs against the unavailability of data
- Some new group divisible designs
Cited in
(4)- Improved conditions for the robustness of binary block designs against the loss of whole blocks
- Designs with blocks of size two and applications to microarray experiments
- Robust assessment of two-treatment higher-order cross-over designs against missing values
- Some more robust block designs against the unavailability of data
This page was built for publication: The use of treatment concurrences to assess robustness of binary block designs against the loss of whole blocks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804155)
