An efficient procedure for the avoidance of disconnected incomplete block designs
From MaRDI portal
Publication:1621400
DOI10.1016/J.CSDA.2013.09.025zbMath1471.62075OpenAlexW2086705928MaRDI QIDQ1621400
Publication date: 8 November 2018
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: http://epubs.surrey.ac.uk/806554/1/CSDA2014.pdf
robustnessconnectivitymissing valuesincomplete block designrank reducing observation setsobservation lossselective partitioning
Computational methods for problems pertaining to statistics (62-08) Statistical block designs (62K10)
Related Items (5)
Special issue on algorithms for design of experiments ⋮ Type-V intermittency from Markov binary block visibility graph perspective ⋮ Designs with blocks of size two and applications to microarray experiments ⋮ Type-II intermittency from Markov binary block visibility graph perspective ⋮ Type-I intermittency from Markov binary block visibility graph perspective
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of cyclic designs using integer programming
- The specification of rank reducing observation sets in experimental design
- Choosing cross-over designs when few subjects are available
- Improved conditions for the robustness of binary block designs against the loss of whole blocks
- On the connectivity problem for \(m\)-way designs
- A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
- Simple Pilot Procedures for the Avoidance of Disconnected Experimental Designs
- Nearly balanced incomplete block designs
- Computer Construction of "D-Optimal" First-Order Designs
- Construction of Optimal Block Designs by Computer
- An evolutionary algorithm for A-optimal incomplete block designs
This page was built for publication: An efficient procedure for the avoidance of disconnected incomplete block designs
