{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreifzcpfap43uzgc27uja6z7662j6oh6bzq66vjiq36p26r5pgbs64e",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mjw3wojtgc22"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.16271v1",
  "publishedAt": "2026-04-20T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Dursun Bulutoglu"
  ],
  "textContent": "**Authors:** Dursun Bulutoglu\n\nWe 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"
}