Construction of d-optimal s₁ s₂ s₃ factorial designs using graph theory

DOI10.1007/S00184-005-0414-ZMaRDI QIDQ811963zbMATH OpenOpenAlexFDO

Authors Vassilis Karagiannis, Chronis Moyssiadis

Publication date 23 January 2006

Published in Metrika (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00184-005-0414-z

zbMATH Keywords

bipartite graphperfect matchingD-optimal designssaturated factorial designs of Resolution III

Mathematics Subject Classification ID

Applications of graph theory (05C90) Optimal statistical designs (62K05) Factorial statistical designs (62K15)

Recommendations

• A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design
• scientific article; zbMATH DE number 933210
• scientific article; zbMATH DE number 862314
• Graph-theoretic techniques in D-optimal design problems
• D-optimal \(2\times2\times s_3\times s_4\) saturated factorial designs

Cited in

(3)

• Graph-theoretic techniques in D-optimal design problems
• A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design
• D-optimal \(2\times2\times s_3\times s_4\) saturated factorial designs

This page was built for publication: Construction of d-optimal \(s_1 \times s_2 \times s_3\) factorial designs using graph theory

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