Construction of exact D-optimal designs by tabu search
From MaRDI portal
Publication:1351866
DOI10.1016/0167-9473(95)00014-3zbMath0900.62403OpenAlexW2050455072MaRDI QIDQ1351866
Publication date: 27 February 1997
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-9473(95)00014-3
Related Items (6)
Application of genetic algorithms to the construction of exact D-optimal designs ⋮ Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm ⋮ A genetic algorithm approach to find the best regression/econometric model among the candidates ⋮ Optimal design of multi-response experiments using semi-definite programming ⋮ Construction of efficient experimental designs under multiple resource constraints ⋮ Applications of optimization heuristics to estimation and modelling problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tabu search techniques. A tutorial and an application to neural networks
- D-optimum weighing designs
- Comparison of design for quadratic regression of cubes
- Future paths for integer programming and links to artificial intelligence
- A user's guide to tabu search
- A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
- Generalized Simulated Annealing for Function Optimization
- The Application of the Annealing Algorithm to the Construction of Exact Optimal Designs for Linear-Regression Models
- Time- and Space-Saving Computer Methods, Related to Mitchell's DETMAX, for Finding D-Optimum Designs
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- Tabu Search—Part I
- Tabu Search—Part II
- D-Optimality for Regression Designs: A Review
- An Algorithm for the Construction of "D-Optimal" Experimental Designs
- An introduction to designh optimality with an overview of the literature
This page was built for publication: Construction of exact D-optimal designs by tabu search
