E\((s^{2})\)-optimal supersaturated designs with good minimax properties when \(N\) is odd
From MaRDI portal
Publication:2480027
DOI10.1016/j.jspi.2007.06.026zbMath1131.62069OpenAlexW1969817879MaRDI QIDQ2480027
Kenneth J. Ryan, Dursun A. Bulutoglu
Publication date: 28 March 2008
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2007.06.026
lower boundminimax criterionCNOA\(_p\) and NOA\(_p\) exchange algorithmscyclically generated designsupersaturated design (SSD)
Related Items (7)
Supersaturated designs: a review of their construction and analysis ⋮ An algorithmic construction of \(E(s^2)\)-optimal supersaturated designs ⋮ Multi-level and mixed-level \(k\)-circulant supersaturated designs ⋮ Addition of runs to a two-level supersaturated design ⋮ \(E(s^2)\)-optimal supersaturated designs with odd number of runs ⋮ Optimal supersaturated designs for \(s^m\) factorials in \(N \not\equiv 0 \pmod s\) runs ⋮ Two-level supersaturated designs: a review
Cites Work
- Exploring \(k\)-circulant supersaturated designs via genetic algorithms
- Construction of \(E(s^2)\)-optimal supersaturated designs
- \(E(s^{2})\)-optimal supersaturated designs with good minimax properties
- Cyclicly constructed \(E(s^{2})\)-optimal supersaturated designs
- \(E(s^{2})\)-optimal and minimax-optimal cyclic supersaturated designs via multi-objective simulated annealing
- A General Method of Constructing E(s2)-Optimal Supersaturated Designs
- An Algorithmic Approach to Constructing Supersaturated Designs
- Another Look at First-Order Saturated Designs: The p-Efficient Designs
- Some Systematic Supersaturated Designs
- Construction of supersaturated designs through partially aliased interactions
- A method for constructing supersaturated designs and its Es2 optimality
- Generating Systematic Supersaturated Designs
This page was built for publication: E\((s^{2})\)-optimal supersaturated designs with good minimax properties when \(N\) is odd
