Three-level supersaturated designs
From MaRDI portal
Publication:1805956
DOI10.1016/S0167-7152(99)00038-3zbMath0958.62071WikidataQ127352290 ScholiaQ127352290MaRDI QIDQ1805956
Publication date: 10 April 2001
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Related Items (52)
Building some bridges among various experimental designs ⋮ Some new results on triple designs ⋮ Multi-level \(k\)-circulant supersaturated designs ⋮ Construction of multi-level supersaturated design via Kronecker product ⋮ Construction of supersaturated design with large number of factors by the complementary design method ⋮ Construction of three-level supersaturated design ⋮ Supersaturated designs: a review of their construction and analysis ⋮ A cyclic construction of saturated and supersaturated designs ⋮ Upper bound on the number of multi-level columns in equally replicated optimal designs minimizing the \(E(f_{NOD})\) criterion ⋮ On Ordering Problems: A Statistical Approach ⋮ Deterministic construction methods for uniform designs ⋮ Subdata selection based on orthogonal array for big data ⋮ A general construction of \(E(f_{NOD})\)-optimal multi-level supersaturated designs ⋮ Construction of optimal supersaturated design with large number of levels ⋮ Design for order‐of‐addition experiments with two‐level components ⋮ Optimal selection and ordering of columns in supersaturated designs ⋮ \(E(\chi ^{2})\)-optimal mixed-level supersaturated designs ⋮ Addition of runs to an \(s\)-level supersaturated design ⋮ Construction of equidistant and weak equidistant supersaturated designs ⋮ Construction methods for three-level supersaturated designs based on weighing matrices. ⋮ Optimal multi-level supersaturated designs through integer programming ⋮ A new method of construction of multi-level supersaturated designs. ⋮ Combinatorial constructions for optimal supersaturated designs. ⋮ Extended mixed-level supersaturated designs ⋮ Optimal mixed-level supersaturated designs and a new class of combinatorial designs ⋮ Optimal mixed-level \(k\)-circulant supersaturated designs ⋮ Optimal mixed-level supersaturated design with general number of runs ⋮ Some combinatorial constructions for optimal mixed-level supersaturated designs ⋮ Lower bounds of various criteria in experimental designs ⋮ Supersaturated designs with high searching probability ⋮ A general construction method for mixed-level supersaturated design ⋮ Computer aided construction of efficient multi-level supersaturated designs ⋮ On construction of optimal mixed-level supersaturated designs ⋮ Some theory and the construction of mixed-level supersaturated designs ⋮ Optimal multi-level supersaturated designs constructed from linear and quadratic functions ⋮ On multi-level supersaturated designs ⋮ Pareto-efficient designs for multi- and mixed-level supersaturated designs ⋮ Uniform supersaturated design and its construction ⋮ Construction of mixed-level supersaturated design ⋮ Construction of minimum generalized aberration designs ⋮ Construction of Efficient Multi-Levelk-Circulant Supersaturated Designs ⋮ Probability of correct model identification in supersaturated design ⋮ Tabu Search and Perturbation Methods in the Construction of Supersaturated Designs ⋮ GeneralizedE(s2) Criterion for Multilevel Supersaturated Designs ⋮ Optimal supersaturated designs for \(s^m\) factorials in \(N \not\equiv 0 \pmod s\) runs ⋮ A tabu search algorithm for the construction of \(\chi^2(D)\)-optimal mixed-level \(k\)-circulant supersaturated designs ⋮ Construction of efficient unbalanced mixed-level supersaturated designs ⋮ Supersaturated designs for asymmetrical factorial experiments ⋮ Construction of some \(E(f_{NOD})\) optimal mixed-level supersaturated designs ⋮ Optimality of mixed-level supersaturated designs ⋮ Construction of optimal multi-level supersaturated designs ⋮ Majorization framework for balanced lattice designs
Cites Work
- Unnamed Item
- An Algorithmic Approach to Constructing Supersaturated Designs
- Some Systematic Supersaturated Designs
- Construction of supersaturated designs through partially aliased interactions
- A method for constructing supersaturated designs and its Es2 optimality
- Supersaturated design including an orthogonal base
- Columnwise-Pairwise Algorithms with Applications to the Construction of Supersaturated Designs
- Generating Systematic Supersaturated Designs
- THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS
This page was built for publication: Three-level supersaturated designs