Supersaturated designs with the maximum number of factors for a given resolution-rank
From MaRDI portal
(Redirected from Publication:2320962)
Recommendations
- Two-level supersaturated designs for 2ᵏ runs and other cases
- Generating Systematic Supersaturated Designs
- Optimal multi-level supersaturated designs through integer programming
- Construction of supersaturated designs involving \(s\)-level factors
- Supersaturated designs: a review of their construction and analysis
Cites work
- scientific article; zbMATH DE number 3490286 (Why is no real title available?)
- scientific article; zbMATH DE number 1321833 (Why is no real title available?)
- A method for constructing supersaturated designs and its Es2 optimality
- An Algorithmic Approach to Constructing Supersaturated Designs
- An Analysis for Unreplicated Fractional Factorials
- Column generation for linear and integer programming
- Construction of \(E(s^2)\)-optimal supersaturated designs
- Construction of supersaturated designs through partially aliased interactions
- Finding MDS-optimal supersaturated designs using computer searches
- Hadamard equivalence via graph isomorphism
- J.N. Srivastava and experimental design
- Marginally oversaturated designs
- Minimal dependent sets for evaluating supersaturated designs
- Model-robust supersaturated and partially supersaturated designs
- On the complexity of approximating extremal determinants in matrices
- Some Systematic Supersaturated Designs
- Some new factor screening designs using the search linear model
- E(s^2)-optimal supersaturated designs with odd number of runs
Cited in
(1)
This page was built for publication: Supersaturated designs with the maximum number of factors for a given resolution-rank
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2320962)