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.
IEEE Transactions on Software Engineering34(5), 633–650 (2008).https://doi.or g/10.1109/TSE.2008.50
1 Pith paper cite this work, alongside 315 external citations. Polarity classification is still indexing.
1
Pith paper citing it
315
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.