D-optimal designs with minimal and nearly minimal number of units
type: Item
instance of: scholarly article
title: D-optimal designs with minimal and nearly minimal number of units
zbMATH Open document ID: 0846.62055
DOI: 10.1016/0378-3758(95)00117-4
author: K. Balasubramanian
author: Aloke Dey
published in: Journal of Statistical Planning and Inference
publication date: 1996-09-05T00:00:00Z
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 62K10
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 906693
zbMATH Keywords: \(D\)-optimality
zbMATH Keywords: bipartite graph
zbMATH Keywords: spanning tree
zbMATH Keywords: connected block designs
zbMATH Keywords: fixed block size
zbMATH Keywords: minimally connected row-column designs
MaRDI profile type: Publication
full work available at URL: 0378-3758(95)00117-4
OpenAlex ID: W2017136842
cites work: Optimal block designs with minimal number of observations
cites work: Optimal a\(\times b\) connected designs with \(a+b\) observations
cites work: Q4894995
cites work: D-optimal block designs with at most six varieties
cites work: Uncertain Resources and Optimal Designs : Problems and Perspectives
cites work: D–optimality of a class of saturated main–effect plans and allied results
cites work: Almost saturated D-optimal main effect plans and allied results
cites work: On the choice of optimality criteria in comparing statistical designs
description: scientific article; zbMATH DE number 906693