Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
From MaRDI portal
(Redirected from Publication:6187007)
Recommendations
Cites work
- Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets
- Classification of orthogonal arrays by integer programming
- Conflict-driven answer set solving: from theory to practice
- Constraint models for the covering test problem
- Covering and radius-covering arrays: constructions and classification
- Covering arrays on graphs
- Families of \(k\)-independent sets
- Generalized packing designs
- Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1496584 (Why is no real title available?)
- scientific article; zbMATH DE number 1903357 (Why is no real title available?)
- Intersection numbers for subspace designs
- New covering array numbers
- New optimal covering arrays using an orderly algorithm
- Nonexistence of a few binary orthogonal arrays
- On the state of strength-three covering arrays
- Orthogonal arrays. Theory and applications
- Packing arrays
- Packing arrays and packing designs
- The CRC handbook of combinatorial designs
- The lattice of \(N\)-run orthogonal arrays
- Theory and Applications of Satisfiability Testing
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Two applications (for search theory and truth functions) of Sperner type theorems
This page was built for publication: Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187007)
