Optimal incomplete-block designs with low replication: a unified approach using graphs
From MaRDI portal
Publication:2063878
DOI10.1007/s42519-021-00215-xzbMath1476.62166OpenAlexW3212178720MaRDI QIDQ2063878
Publication date: 3 January 2022
Published in: Journal of Statistical Theory and Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s42519-021-00215-x
Cites Work
- An algorithm for optimization of block designs
- Optimal block designs with minimal number of observations
- Variance and concurrence in block designs, and distance in the corresponding graphs
- Maximizing the total number of spanning trees in a graph: two related problems in graph theory and optimum design theory
- D-optimal block designs with at most six varieties
- Connected graphs with a minimal number of spanning trees
- A-optimal connected block designs with nearly minimal number of observations
- Theory of optimal designs
- D-optimal designs with minimal and nearly minimal number of units
- Block designs and electrical networks
- A note on robustness of D-optimal block designs for two-colour microarray experiments
- Circuits and efficiency in incomplete block designs
- Uncertain Resources and Optimal Designs : Problems and Perspectives
- Optimal Design of Experiments
- Experimental design for gene expression microarrays
- Near-Optimal Designs for Dual Channel Microarray Studies
- Self-dual configurations and regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimal incomplete-block designs with low replication: a unified approach using graphs