Nearly balanced incomplete block designs

DOI10.1093/BIOMET/68.2.493MaRDI QIDQ3925024zbMATH OpenOpenAlexFDO

Authors Ching-Shui Cheng, C. F. Jeff Wu

Publication date 1981

Published in Biometrika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/biomet/68.2.493

zbMATH Keywords

A-efficiencyD-efficiencyHamiltonian cyclenearly balanced incomplete block designregular graph design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Statistical block designs (62K10)

Cited in

(10)

• On Kronecker block designs for factorial experiments
• On the A-, D-, E- and L-efficiency of block designs
• Optimal variance- and efficiency-balanced designs for one- and two-way elimination of heterogeneity
• Optimality of a class of efficiency-balanced designs
• An efficient procedure for the avoidance of disconnected incomplete block designs
• MBMUDs: A combinatorial extension of BIBDs showing good optimality behaviour
• On Φ_p-optimality of Incomplete Block Designs: An Algorithm
• Efficient Block Designs for Dependent Observations—A Computer-Aided Search
• Binary designs are not always the best
• On the D-optimality of group divisible designs

This page was built for publication: Nearly balanced incomplete block designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3925024)