Scholarlink

Balanced Incomplete Block Designs are of use in the layout of data blocks in Redundant Arrays of Independent Disks (RAID) and in drug trials. In that context, BIBDs that minimize the range of block sums are often sought. In this paper, we present a new Constraint Programming model to achieve these optimal designs. We show that the new model is competitive with previous BIBD-generating algorithms and introduce a new symmetry breaking constraint.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Constraint Programming Generation of Optimal Balanced Incomplete Block Design

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Stephanie Budzisz,
  • Serge Kruk

摘要

Balanced Incomplete Block Designs are of use in the layout of data blocks in Redundant Arrays of Independent Disks (RAID) and in drug trials. In that context, BIBDs that minimize the range of block sums are often sought. In this paper, we present a new Constraint Programming model to achieve these optimal designs. We show that the new model is competitive with previous BIBD-generating algorithms and introduce a new symmetry breaking constraint.