A parallelized branch-and-bound with isomorphism pruning algorithm achieves linear speedups for OA(128,9,2,4) and OA(144,9,2,4) and classifies all non-OD-equivalent OA(192,k,2,4) for k=9,10,11 for the first time.
A computational study of search strategies for mixed integer programming
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Parallelizing the branch-and-bound with isomorphism pruning algorithm for classifying orthogonal arrays
A parallelized branch-and-bound with isomorphism pruning algorithm achieves linear speedups for OA(128,9,2,4) and OA(144,9,2,4) and classifies all non-OD-equivalent OA(192,k,2,4) for k=9,10,11 for the first time.