A-optimal connected block designs with nearly minimal number of observations

DOI10.1016/S0378-3758(97)00054-2zbMath0907.62084OpenAlexW2095376407MaRDI QIDQ1378810

Olaf Krafft, Martin Schaefer

Publication date: 9 February 1998

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0378-3758(97)00054-2

zbMATH Keywords

A-optimalitydistance matrix

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Applications of graph theory (05C90) Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Statistical block designs (62K10) Distance in graphs (05C12)

Related Items

Linear estimation in models based on a graph, A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design, Optimal incomplete-block designs with low replication: a unified approach using graphs, Two-factor saturated designs: cycles, Gini index, and state polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal block designs with minimal number of observations
• Optimal a\(\times b\) connected designs with \(a+b\) observations
• 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
• Parallel concepts in graph theory
• D–optimality of a class of saturated main–effect plans and allied results
• Uncertain Resources and Optimal Designs : Problems and Perspectives