Parallelizing the branch-and-bound with isomorphism pruning algorithm for classifying orthogonal arrays
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913041219584000 |
|---|---|
| author | Bulutoglu, Dursun |
| author_facet | Bulutoglu, Dursun |
| contents | We provide a method for parallelizing the branch-and-bound with isomorphism pruning algorithm developed by Margot [Symmetric ILP: Coloring and small integers, Discrete Optimization (4) (2007), 40-62]. We apply our method to classify orthogonal arrays. For classifying all non-OD- equivalent OA(128, 9, 2, 4) and OA(144, 9, 2, 4) our method results in linear speedups. Finally, our method enables classifying all non-OD-equivalent OA(192, k, 2, 4) for k = 9, 10, 11 for the first time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_16271 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Parallelizing the branch-and-bound with isomorphism pruning algorithm for classifying orthogonal arrays Bulutoglu, Dursun Data Structures and Algorithms Combinatorics 65Y05 05B15 20B05 05E18 (primary) We provide a method for parallelizing the branch-and-bound with isomorphism pruning algorithm developed by Margot [Symmetric ILP: Coloring and small integers, Discrete Optimization (4) (2007), 40-62]. We apply our method to classify orthogonal arrays. For classifying all non-OD- equivalent OA(128, 9, 2, 4) and OA(144, 9, 2, 4) our method results in linear speedups. Finally, our method enables classifying all non-OD-equivalent OA(192, k, 2, 4) for k = 9, 10, 11 for the first time. |
| title | Parallelizing the branch-and-bound with isomorphism pruning algorithm for classifying orthogonal arrays |
| topic | Data Structures and Algorithms Combinatorics 65Y05 05B15 20B05 05E18 (primary) |
| url | https://arxiv.org/abs/2604.16271 |