MiniZinc benchmarks

该数据集包含了七个曾在MiniZinc挑战中使用的约束优化问题（COPs），其中的实例数量从50个到数千个不等，用于评估约束求解器（CP solvers）。此外，数据集还包括了不同目标函数的最小化问题，以及不同大小的训练集，以评估边界估计的影响。这些问题实例的数量规模从每个问题50个到超过11,000个不等。该数据集的任务是对约束优化问题（COPs）进行边界估计。

This dataset includes seven constraint optimization problems (COPs) that were utilized in the MiniZinc Challenge. The total number of instances across these seven problems ranges from 50 to thousands, and the dataset is intended to evaluate constraint solvers (CP solvers). Furthermore, the dataset features minimization problems with different objective functions and training sets of various sizes, which are used to assess the impact of bound estimation. The number of instances for each individual problem varies from 50 to more than 11,000. The core task of this dataset is to perform bound estimation for constraint optimization problems (COPs).

搜集汇总

背景与挑战

背景概述

该数据集是MiniZinc基准测试套件，包含从2008-2012年MiniZinc挑战赛的多种优化和约束满足问题实例，覆盖了广泛的领域如调度、包装和谜题求解。所有模型和数据文件均基于MIT许可证发布，放置在公共领域，便于研究和开发使用。