Graph-theoretic techniques in D-optimal design problems
type: Item
instance of: scholarly article
title: Graph-theoretic techniques in D-optimal design problems
zbMATH Open document ID: 0989.62040
DOI: 10.1016/S0378-3758(01)00097-0
author: Kashinath Chatterjee
author: Giri Narasimhan
published in: Journal of Statistical Planning and Inference
publication date: 2002-05-28T00:00:00Z
Mathematics Subject Classification ID: 62K05
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 1746175
zbMATH Keywords: bipartite graphs
zbMATH Keywords: perfect matching
MaRDI profile type: Publication
cites work: E-optimal 2ksaturated designs
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: Q4057549
cites work: Matching theory
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: \(E\)-optimal minimally connected block designs under mixed effects model
cites work: Almost saturated D-optimal main effect plans and allied results
cites work: Matching is as easy as matrix inversion
description: scientific article; zbMATH DE number 1746175