Branch-and-Bound Search for Experimental Designs Based onDOptimality and Other Criteria

Abstract

This article presents a branch-and-bound algorithm that constructs a catalog of all D-optimal n-point designs for specified design region, linear model, and number of observations, n. While the primary design criterion is D optimality, the algorithm may also be. used to find designs performing well by other secondary criteria, if a small sacrifice in ellkiency as measured by D optimahty is accepted. Finally, some designs are supplied for a quadratic response surface model.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 139 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.