Pages that link to "Item:Q2475747"
From MaRDI portal
The following pages link to Classification of orthogonal arrays by integer programming (Q2475747):
Displayed 31 items.
- Nonexistence of a few binary orthogonal arrays (Q516803) (← links)
- Classification of three-level strength-3 arrays (Q665028) (← links)
- An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays (Q745403) (← links)
- Uniform semi-Latin squares and their pairwise-variance aberrations (Q830735) (← links)
- Quarter-fraction factorial designs constructed via quaternary codes (Q834351) (← links)
- \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V (Q953836) (← links)
- Recent developments in nonregular fractional factorial designs (Q975573) (← links)
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints (Q995427) (← links)
- Covering arrays via set covers (Q1742691) (← links)
- Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays (Q1743299) (← links)
- Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms (Q2104010) (← links)
- Finding the dimension of a non-empty orthogonal array polytope (Q2172088) (← links)
- Improved WLP and GWP lower bounds based on exact integer programming (Q2266886) (← links)
- Problems and algorithms for covering arrays via set covers (Q2333828) (← links)
- Algorithms for finding generalized minimum aberration designs (Q2349095) (← links)
- An algorithm for generating good mixed level factorial designs (Q2416773) (← links)
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays (Q2419587) (← links)
- Exploiting symmetry in integer convex optimization using core points (Q2450624) (← links)
- Symmetric ILP: Coloring and small integers (Q2471273) (← links)
- Simplicity conditions for binary orthogonal arrays (Q2678983) (← links)
- Exploiting Symmetries in Polyhedral Computations (Q2849003) (← links)
- Encryption schemes using orthogonal arrays (Q3560586) (← links)
- Complete enumeration of pure-level and mixed-level orthogonal arrays (Q3576969) (← links)
- Equivalence of Lattice Orbit Polytopes (Q4564021) (← links)
- Coarse-grained entanglement classification through orthogonal arrays (Q4583103) (← links)
- (Q4994226) (← links)
- A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs (Q5261011) (← links)
- Integer Programming for Classifying Orthogonal Arrays (Q5374250) (← links)
- The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program (Q5739901) (← links)
- Systematic enumeration of two-level even-odd designs of strength 3 (Q6167057) (← links)
- Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods (Q6187007) (← links)