MKP Instances

该数据集包含了常见的多维度背包问题（Multi-dimensional Knapsack Problem, MKP）实例，这些实例来源于ORLIB。此外，数据集还能够处理不等式约束，同时提供了表示成本和约束函数的二次无约束二进制优化（QUBO）矩阵。任务类型为优化。

This dataset contains common benchmark instances of the Multi-dimensional Knapsack Problem (MKP), which are sourced from ORLIB. Additionally, this dataset supports handling inequality constraints, and provides quadratic unconstrained binary optimization (QUBO) matrices that represent the cost and constraint functions. The task type is optimization.

搜集汇总

背景与挑战

背景概述

MKP Instances数据集包含48个多背包问题的实例，用于测试和比较不同优化算法的性能。每个实例都有明确的格式和已知的最优解，适用于算法研究和性能评估。