Supersaturated designs with the maximum number of factors for a given resolution-rank
From MaRDI portal
Publication:2320962
DOI10.1080/15598608.2014.916242zbMath1425.62106OpenAlexW2042838370MaRDI QIDQ2320962
Alex J. Gutman, Dursun A. Bulutoglu, Edward D. White
Publication date: 28 August 2019
Published in: Journal of Statistical Theory and Practice (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/15598608.2014.916242
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- J.N. Srivastava and experimental design
- Model-robust supersaturated and partially supersaturated designs
- Some new factor screening designs using the search linear model
- Hadamard equivalence via graph isomorphism
- On the complexity of approximating extremal determinants in matrices
- Construction of \(E(s^2)\)-optimal supersaturated designs
- Column generation for linear and integer programming
- \(E(s^2)\)-optimal supersaturated designs with odd number of runs
- Finding MDS-optimal supersaturated designs using computer searches
- An Algorithmic Approach to Constructing Supersaturated Designs
- Marginally oversaturated designs
- An Analysis for Unreplicated Fractional Factorials
- Some Systematic Supersaturated Designs
- Construction of supersaturated designs through partially aliased interactions
- A method for constructing supersaturated designs and its Es2 optimality
This page was built for publication: Supersaturated designs with the maximum number of factors for a given resolution-rank