Graph based isomorph-free generation of two-level regular fractional factorial designs
From MaRDI portal
Publication:1036716
DOI10.1016/j.jspi.2009.07.003zbMath1178.62082OpenAlexW2020956206MaRDI QIDQ1036716
Yu Ding, Abhishek K. Shrivastava
Publication date: 13 November 2009
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.2009.07.003
automorphismgraphsisomorphismcanonical labelingdefining contrast subgroupdesign cataloglarge designstreatment combinations subgroup
Related Items
On equivalence of fractional factorial designs based on singular value decomposition ⋮ Equivalence of factorial designs with qualitative and quantitative factors ⋮ Regression and Kriging metamodels with their experimental designs in simulation: a review ⋮ Unnamed Item ⋮ Combinatorial Equivalence of Fractional Factorial Designs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A catalogue of three-level regular fractional factorial designs
- Some results on \(2^{n-k}\) fractional factorial designs and search for minimum aberration designs
- Geometric isomorphism and minimum aberration for factorial designs with quantitative factors
- An isomorphism check for two-level fractional factorial designs
- A survey and evaluation of methods for determination of combinatorial equivalence of factorial designs
- LAPACK Users' Guide
- Patterns of confounding in factorial designs
- The graph isomorphism disease
- Basic Linear Algebra Subprograms for Fortran Usage
- Isomorph-Free Exhaustive Generation
- A Catalogue of Two-Level and Three-Level Fractional Factorial Designs with Small Runs
- The Construction of Saturated $2^{k-p}_R$ Designs
- Construction of a Set of 512-Run Designs of Resolution $\geqq 5$ and a Set of Even 1024-Run Designs of Resolution $\geqq 6$
- On the isomorphism of fractional factorial designs
