A linear programming bound for orthogonal arrays with mixed levels
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4018165 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 775846 (Why is no real title available?)
- scientific article; zbMATH DE number 3430682 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- scientific article; zbMATH DE number 3352656 (Why is no real title available?)
- scientific article; zbMATH DE number 2232233 (Why is no real title available?)
- scientific article; zbMATH DE number 3048068 (Why is no real title available?)
- A linear programming bound for orthogonal arrays with mixed levels
- Construction of \(2^ m4^ n\) designs via a grouping scheme
- Mixed orthogonal arrays for variance estimation with unequal numbers of primary selections per stratum
- Nearly Orthogonal Arrays with Mixed Levels and Small Runs
- On the construction of asymmetrical orthogonal arrays
- Orthogonal arrays with variable numbers of symbols
- Some Main-Effect Plans and Orthogonal Arrays of Strength Two
- Some Orthogonal Main-Effect Plans for Asymmetrical Factorials
- The Geometry of Two-Weight Codes
Cited in
(27)- Linear programming bounds for balanced arrays
- Generalized wordtype pattern for nonregular factorial designs with multiple groups of factors
- Parameter inequalities for orthogonal arrays with mixed levels
- Theory of optimal blocking of nonregular factorial designs
- Characterization of minimum aberration mixed factorials in terms of consulting designs
- On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
- A search of maximum generalized resolution quaternary-code designs via integer linear programming
- Theory of optimal blocking of \(2^{n-m}\) designs
- A Note on the Construction of Near-Orthogonal Arrays with Mixed Levels and Economic Run Size
- Generalized minimum aberration for asymmetrical fractional factorial designs
- A scientific tour on orthogonal arrays
- Generalized minimum aberration for asymmetrical fractional factorial designs.
- Theory of minimum aberration blocked regular mixed factorial designs
- Construction of uniform U-designs
- Uniformity in factorial designs with mixed levels
- Approximation of bounds on mixed-level orthogonal arrays
- A note on the connection between uniformity and generalized minimum aberration
- An application of information theory and error-correcting codes to fractional factorial experiments
- The lattice of \(N\)-run orthogonal arrays
- A linear programming bound for orthogonal arrays with mixed levels
- Design of experiments: useful orthogonal arrays for number of experiments from 4 to 16
- Some \(LP\) algorithms using orthogonal matrices
- Commutative association schemes
- Exact solutions to linear programming problems
- Improved WLP and GWP lower bounds based on exact integer programming
- Optimal Additions to and Deletions from Two-Level Orthogonal Arrays
- scientific article; zbMATH DE number 1123782 (Why is no real title available?)
This page was built for publication: A linear programming bound for orthogonal arrays with mixed levels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1361727)
