Combinatorial Design Problems

该数据集包含了组合设计问题的开放实例，如Bhaskar Rao设计、对称称重矩阵、平衡三元设计、覆盖序列、Johnson团覆盖和删除码等。除了开放实例的解决方案，数据集还提供了构建这些解决方案的代码，这保证了研究的可复现性，并为进一步的研究提供了便利。该任务旨在使用生成的搜索启发式方法解决组合设计问题的开放实例。This dataset contains open instances of combinatorial design problems, such as Bhaskar Rao designs, symmetric weighing matrices, balanced ternary designs, covering sequences, Johnson clique covers, and deletion codes. In addition to the solutions for these open instances, the dataset also provides code for constructing these solutions, which ensures the reproducibility of relevant research and facilitates further studies. The task aims to solve the open instances of combinatorial design problems using generated search heuristics.