Combinatorial Equivalence of Fractional Factorial Designs
From MaRDI portal
Publication:5259145
DOI10.1080/03610918.2013.800207zbMath1328.62492OpenAlexW1984631497MaRDI QIDQ5259145
Publication date: 24 June 2015
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2013.800207
Related Items (1)
Cites Work
- Graph based isomorph-free generation of two-level regular fractional factorial designs
- Indicator function based on complex contrasts and its application in general factorial designs
- Some results on \(2^{n-k}\) fractional factorial designs and search for minimum aberration designs
- On the number of \(D\)-optimal designs
- An isomorphism check for two-level fractional factorial designs
- A survey and evaluation of methods for determination of combinatorial equivalence of factorial designs
- Estimate of the number of restricted integer-partitions
- A sensitive algorithm for detecting the inequivalence of Hadamard matrices
- Construction of the Set of 256-Run Designs of Resolution $\geqq 5$ and the Set of Even 512-Run Designs of Resolution $\geqq 6$ with Special Reference to the Unique Saturated Designs
- On the isomorphism of fractional factorial designs
This page was built for publication: Combinatorial Equivalence of Fractional Factorial Designs