A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design
DOI10.1016/j.jspi.2007.05.049zbMath1131.62072OpenAlexW2019001933MaRDI QIDQ2480023
Vassilis Karagiannis, Chronis Moyssiadis
Publication date: 28 March 2008
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2007.05.049
bipartite graphperfect matchingD-optimal designsproperty \(\mathcal P_i\)saturated factorial designs of resolution III
Optimal statistical designs (62K05) Applications of graph theory (05C90) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Factorial statistical designs (62K15) Graphical methods in numerical analysis (65S05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal block designs with minimal number of observations
- Optimal a\(\times b\) connected designs with \(a+b\) observations
- Construction of d-optimal \(s_1 \times s_2 \times s_3\) factorial designs using graph theory
- Almost saturated D-optimal main effect plans and allied results
- Matching theory
- On invariance and randomization in factorial designs with applications to D-optimal main effect designs of the symmetrical factorial
- 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
- A-optimal connected block designs with nearly minimal number of observations
- Graph-theoretic techniques in D-optimal design problems
- D-optimal designs with minimal and nearly minimal number of units
- Some D-optimal saturated designs for \(3\times m_{2}\times m_{3}\) factorials
- D–optimality of a class of saturated main–effect plans and allied results
This page was built for publication: A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design
