Graph-theoretic techniques in D-optimal design problems
From MaRDI portal
Publication:1598699
DOI10.1016/S0378-3758(01)00097-0zbMath0989.62040MaRDI QIDQ1598699
Giri Narasimhan, Kashinath Chatterjee
Publication date: 28 May 2002
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Related Items
A graphical construction of the D-optimal saturated, \(3\times s^{2}\) main effect, factorial design, Some D-optimal saturated designs for \(3\times m_{2}\times m_{3}\) factorials
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal block designs with minimal number of observations
- Optimal a\(\times b\) connected designs with \(a+b\) observations
- Almost saturated D-optimal main effect plans and allied results
- Matching theory
- Matching is as easy as matrix inversion
- \(E\)-optimal minimally connected block designs under mixed effects model
- E-optimal 2ksaturated designs
- D–optimality of a class of saturated main–effect plans and allied results
- Uncertain Resources and Optimal Designs : Problems and Perspectives