Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods
From MaRDI portal
Publication:6187007
DOI10.1002/JCD.21876MaRDI QIDQ6187007FDOQ6187007
Authors: Ludwig Kampel, Ilias S. Kotsireas, Dimitris Simos 
Publication date: 5 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Recommendations
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Theory and Applications of Satisfiability Testing
- Orthogonal arrays. Theory and applications
- The CRC handbook of combinatorial designs
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- Title not available (Why is that?)
- Conflict-driven answer set solving: from theory to practice
- Intersection numbers for subspace designs
- Generalized packing designs
- Covering arrays on graphs
- Packing arrays
- Packing arrays and packing designs
- On the state of strength-three covering arrays
- Covering and radius-covering arrays: constructions and classification
- Title not available (Why is that?)
- The lattice of \(N\)-run orthogonal arrays
- Classification of orthogonal arrays by integer programming
- Nonexistence of a few binary orthogonal arrays
- Constraint models for the covering test problem
- Title not available (Why is that?)
- New covering array numbers
- New optimal covering arrays using an orderly algorithm
- Generating combinatorial test cases by efficient SAT encodings suitable for CDCL SAT solvers
- Algebraic models for arbitrary strength covering arrays over \(v\)-ary alphabets
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)
