Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
From MaRDI portal
Publication:6187007
DOI10.1002/jcd.21876MaRDI QIDQ6187007
Ilias S. Kotsireas, Ludwig Kampel, Unnamed Author, Dimitris E. Simos
Publication date: 5 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized packing designs
- Nonexistence of a few binary orthogonal arrays
- Packing arrays
- Packing arrays and packing designs
- Covering and radius-covering arrays: constructions and classification
- Constraint models for the covering test problem
- Orthogonal arrays. Theory and applications
- The lattice of \(N\)-run orthogonal arrays
- Conflict-driven answer set solving: from theory to practice
- New covering array numbers
- Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets
- Classification of orthogonal arrays by integer programming
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- Covering arrays on graphs
- On the state of strength-three covering arrays
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- New optimal covering arrays using an orderly algorithm
- Generating Combinatorial Test Cases by Efficient SAT Encodings Suitable for CDCL SAT Solvers
- Theory and Applications of Satisfiability Testing
- Intersection Numbers For Subspace Designs
