Application of genetic algorithms to the construction of exact D-optimal designs
From MaRDI portal
Publication:4269564
DOI10.1080/02664769822800zbMath0933.62063OpenAlexW2018639206MaRDI QIDQ4269564
Danny C. Myers, Grace Montepiedra, Arthur B. Yeh
Publication date: 9 April 2000
Published in: Journal of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02664769822800
Related Items
Computing efficient exact designs of experiments using integer quadratic programming, Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm, Construction of efficient experimental designs under multiple resource constraints, Optimal designs to select individuals for genotyping conditional on observed binary or survival outcomes and non-genetic covariates, Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs, Least squares polynomial chaos expansion: a review of sampling strategies
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of exact D-optimal designs by tabu search
- A genetic algorithm for the linear transportation problem
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs