Constructing two-level Q_B-optimal screening designs using mixed-integer programming and heuristic algorithms
From MaRDI portal
Publication:2104010
DOI10.1007/S11222-022-10168-1zbMATH Open1499.62037OpenAlexW4309938105MaRDI QIDQ2104010FDOQ2104010
Alan R. Vazquez, Weng Kee Wong, P. Goos
Publication date: 9 December 2022
Published in: Statistics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11222-022-10168-1
Recommendations
- New families of \(Q_{B}\)-optimal saturated two-level main effects screening designs
- Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
- Optimal multi-level supersaturated designs through integer programming
- Constructing definitive screening designs using cyclic generators
- Efficient algorithms for constructing \(D\)- and \(I\)-optimal exact designs for linear and non-linear models in mixture experiments
Computational methods for problems pertaining to statistics (62-08) Factorial statistical designs (62K15) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Bayesian variable selection with related predictors
- Best subset selection via a modern optimization lens
- Optimum experimental designs, with SAS
- Title not available (Why is that?)
- Experiments. Planning, analysis and optimization.
- 50 Years of Integer Programming 1958-2008
- Minimum \(G_2\)-aberration for nonregular fractional factorial designs
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Computational study of a family of mixed-integer quadratic programming problems
- A brief history of linear and mixed-integer programming computation
- Title not available (Why is that?)
- Algorithm for cardinality-constrained quadratic optimization
- Theory of \(J\)-characteristics for fractional factorial designs and projection justification of minimum \(G_2\)-aberration
- Some Systematic Supersaturated Designs
- An iterated local search algorithm for the vehicle routing problem with backhauls
- Finding maximin Latin hypercube designs by iterated local search heuristics
- A Bayesian Variable-Selection Approach for Analyzing Designed Experiments with Complex Aliasing
- A Comparison of Algorithms for Constructing Exact D-Optimal Designs
- A Simple Bayesian Modification of D-Optimal Designs to Reduce Dependence on an Assumed Model
- The Coordinate-Exchange Algorithm for Constructing Exact Optimal Experimental Designs
- Model-robust supersaturated and partially supersaturated designs
- Minimum aberration construction results for nonregular two-level fractional factorial designs
- Another Look at First-Order Saturated Designs: The p-Efficient Designs
- Projective three-level main effects designs robust to model uncertainty
- Computing efficient exact designs of experiments using integer quadratic programming
- Classification of orthogonal arrays by integer programming
- Optimal design of large-scale screening experiments: a critical look at the coordinate-exchange algorithm
- Bayesian D-optimal supersaturated designs
- Integer Programming
- An iterated local search algorithm for learning Bayesian networks with restarts based on conditional independence tests
- Three-level main-effects designs exploiting prior information about model uncertainty
- Some theory for constructing minimum aberration fractional factorial designs
- Screening by conference designs
- Model-robust and model-sensitive designs
- New families of \(Q_{B}\)-optimal saturated two-level main effects screening designs
- Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
- An algorithm for generating good mixed level factorial designs
Cited In (1)
Uses Software
This page was built for publication: Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104010)
