Classification of orthogonal arrays by integer programming
From MaRDI portal
Publication:2475747
DOI10.1016/j.jspi.2006.12.003zbMath1139.62041OpenAlexW2172119955MaRDI QIDQ2475747
Dursun A. Bulutoglu, Margot, François
Publication date: 11 March 2008
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.2006.12.003
fractional factorial designsisomorphism classesisomorphism pruning\(D\)-optimal designscovering arrayspacking arrays
Optimal statistical designs (62K05) Integer programming (90C10) Factorial statistical designs (62K15)
Related Items
Uniform semi-Latin squares and their pairwise-variance aberrations, Quarter-fraction factorial designs constructed via quaternary codes, Equivalence of Lattice Orbit Polytopes, Finding the dimension of a non-empty orthogonal array polytope, Coarse-grained entanglement classification through orthogonal arrays, An algorithm for generating good mixed level factorial designs, Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays, Simplicity conditions for binary orthogonal arrays, Unnamed Item, Systematic enumeration of two-level even-odd designs of strength 3, Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods, Exploiting symmetry in integer convex optimization using core points, Classification of three-level strength-3 arrays, Covering arrays via set covers, Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays, Encryption schemes using orthogonal arrays, Symmetric ILP: Coloring and small integers, \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V, Nonexistence of a few binary orthogonal arrays, Complete enumeration of pure-level and mixed-level orthogonal arrays, The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program, Recent developments in nonregular fractional factorial designs, Improved WLP and GWP lower bounds based on exact integer programming, Integer Programming for Classifying Orthogonal Arrays, Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints, An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays, Exploiting Symmetries in Polyhedral Computations, Problems and algorithms for covering arrays via set covers, A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs, Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms, Algorithms for finding generalized minimum aberration designs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing arrays
- An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
- Constraint models for the covering test problem
- Roux-type constructions for covering arrays of strengths three and four
- Constructing strength three covering arrays with augmented annealing
- \(D\)-optimal and near \(D\)-optimal \(2^k\) fractional factorial designs of resolution V
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- Orthogonal arrays with variable numbers of symbols
- Orthogonal arrays. Theory and applications
- On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
- Classification of affine resolvable \(2\)-\((27,9,4)\) designs
- On the construction and existence of orthogonal arrays with three levels and indexes 1 and 2
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- Exploiting orbits in symmetric ILP
- Generalized minimum aberration for asymmetrical fractional factorial designs
- Solving hard set covering problems
- Further contributions to nonisomorphic two level orthogonal arrays
- Strength two covering arrays: existence tables and projection
- Symmetric ILP: Coloring and small integers
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- A review of some exchange algorithms for constructing discrete \(D\)-optimal designs
- On the state of strength-three covering arrays
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A note on some computationally difficult set covering problems
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Universal Optimality of Fractional Factorial Plans Derivable Through Orthogonal Arrays
- A Branch & Cut algorithm for a four-index assignment problem
- Covering arrays and intersecting codes
- On Orthogonal Arrays
- On the isomorphism of fractional factorial designs
