Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria

1 February 1982

journal article
Published by JSTOR in Technometrics

Vol. 24 (1) , 41
https://doi.org/10.2307/1267576

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 num...

Keywords

BOUND SEARCH
EXPERIMENTAL DESIGNS
MODEL
OPTIMAL
BRANCH
CATALOG
NUM
SPECIFIED
SEARCH FOR EXPERIMENTAL

This publication has 0 references indexed in Scilit: