A new exact integer-programming method and structural bounds for pairwise covering arrays with forbidden binary assignments, plus a fast heuristic that often matches optimal solutions.
In: 2013 IEEE International Conference on Software Maintenance
1 Pith paper cite this work, alongside 50 external citations. Polarity classification is still indexing.
1
Pith paper citing it
50
external citations · OpenAlex
fields
math.OC 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimal Combinatorial Testing with Constraints: The Balancing Act
A new exact integer-programming method and structural bounds for pairwise covering arrays with forbidden binary assignments, plus a fast heuristic that often matches optimal solutions.