Classification of orthogonal arrays by integer programming
From MaRDI portal
Recommendations
- Integer programming for classifying orthogonal arrays
- Permutation groups and integer linear algebra for enumeration of orthogonal arrays
- Algorithm for the construction and classification of orthogonal arrays and its feasibility
- scientific article; zbMATH DE number 933193
- An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
Cites work
- scientific article; zbMATH DE number 4211310 (Why is no real title available?)
- scientific article; zbMATH DE number 3470175 (Why is no real title available?)
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 1464593 (Why is no real title available?)
- scientific article; zbMATH DE number 6791305 (Why is no real title available?)
- scientific article; zbMATH DE number 3323559 (Why is no real title available?)
- A Branch & Cut algorithm for a four-index assignment problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A note on some computationally difficult set covering problems
- A review of some exchange algorithms for constructing discrete D-optimal designs
- An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
- Classification of affine resolvable 2-(27,9,4) designs
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- Constraint models for the covering test problem
- Constructing strength three covering arrays with augmented annealing
- Covering arrays and intersecting codes
- Equivalence of fractional factorial designs
- Exploiting orbits in symmetric ILP
- Families of \(k\)-independent sets
- Further contributions to nonisomorphic two level orthogonal arrays
- Generalized minimum aberration for asymmetrical fractional factorial designs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On Orthogonal Arrays
- On the construction and existence of orthogonal arrays with three levels and indexes 1 and 2
- On the isomorphism of fractional factorial designs
- On the maximal number of factors and the enumeration of 3-symbol orthogonal arrays of strength 3 and index 2
- On the state of strength-three covering arrays
- Orthogonal arrays with variable numbers of symbols
- Orthogonal arrays. Theory and applications
- Packing arrays
- Pruning by isomorphism in branch-and-cut
- Roux-type constructions for covering arrays of strengths three and four
- Small covering designs by branch-and-cut
- Software and hardware testing using combinatorial covering suites
- Solving hard set covering problems
- 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
- Universal Optimality of Fractional Factorial Plans Derivable Through Orthogonal Arrays
- D-optimal and near D-optimal 2ᵏ fractional factorial designs of resolution V
Cited in
(36)- Exploiting symmetries in polyhedral computations
- Constructing two-level \(Q_B\)-optimal screening designs using mixed-integer programming and heuristic algorithms
- Uniform semi-Latin squares and their pairwise-variance aberrations
- Complete enumeration of two-level orthogonal arrays of strength \(d\) with \(d+2\) constraints
- An algorithm for generating good mixed level factorial designs
- Nonexistence of (9, 112, 4) and (10, 224, 5) binary orthogonal arrays
- Quarter-fraction factorial designs constructed via quaternary codes
- Covering arrays via set covers
- Permutation groups and integer linear algebra for enumeration of orthogonal arrays
- Equivalence of lattice orbit polytopes
- A Bird’s-Eye View of Modern Symmetric Cryptography from Combinatorial Designs
- Integer programming for classifying orthogonal arrays
- Systematic enumeration of two-level even-odd designs of strength 3
- scientific article; zbMATH DE number 7360437 (Why is no real title available?)
- The linear programming relaxation permutation symmetry group of an orthogonal array defining integer linear program
- Exploiting symmetry in integer convex optimization using core points
- Algorithms for finding generalized minimum aberration designs
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
- A Branch & Cut algorithm for a four-index assignment problem
- Problems and algorithms for covering arrays via set covers
- Mixed-integer linear programming for computing optimal experimental designs
- Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
- Symmetric ILP: Coloring and small integers
- Recent developments in nonregular fractional factorial designs
- Enumeration and Multicriteria Selection of Orthogonal Minimally Aliased Response Surface Designs
- Finding the dimension of a non-empty orthogonal array polytope
- Encryption schemes using orthogonal arrays
- Algorithm for the construction and classification of orthogonal arrays and its feasibility
- Simplicity conditions for binary orthogonal arrays
- D-optimal and near D-optimal 2ᵏ fractional factorial designs of resolution V
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Classification of three-level strength-3 arrays
- Nonexistence of a few binary orthogonal arrays
- Coarse-grained entanglement classification through orthogonal arrays
- Improved WLP and GWP lower bounds based on exact integer programming
- An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays
This page was built for publication: Classification of orthogonal arrays by integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2475747)
