Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria
From MaRDI portal
Publication:3942252
DOI10.2307/1267576zbMath0483.62064OpenAlexW4245192389MaRDI QIDQ3942252
Publication date: 1982
Published in: Technometrics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1267576
Related Items
Generalized maximum-entropy sampling, A new approach to the construction of optimal designs, Computing efficient exact designs of experiments using integer quadratic programming, Application of genetic algorithms to the construction of exact D-optimal designs, Optimal designs for experiments with mixtures: a survey, Optimal sequential designs for on-line item estimation, Convex relaxation for IMSE optimal design in random-field models, Multiplicative methods for computing \(D\)-optimal stratified designs of experiments, Computing exact \(D\)-optimal designs by mixed integer second-order cone programming, A graphical method for evaluating mixture designs with respect to the slope, Efficient maximin distance designs for experiments in mixtures, Efficient computational algorithm for optimal continuous experimental designs, Construction of efficient experimental designs under multiple resource constraints, An integrative framework for geometric and hidden projections in three-level fractional factorial designs, Optimal designs for simultaneous item estimation, Response surface design evaluation and comparison, D-optimal designs for sensor and actuator locations, Optimal exact designs of experiments via mixed integer nonlinear programming, A clustering-based coordinate exchange algorithm for generating G-optimal experimental designs, A branch-and-bound algorithm for the exact optimal experimental design problem, Computing D-Optimal Experimental Designs for Estimating Treatment Contrasts Under the Presence of a Nuisance Time Trend, A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
