0-1 Knapsack
收藏arXiv2025-09-30 收录
下载链接：
https://github.com/minori5214/rl-guided-didp
下载链接
链接失效反馈官方服务：
资源简介：
该数据集涉及的是一个组合优化问题，目标是最大化背包内物品的总价值，同时不超过背包的容量。数据实例是基于固定分布生成的，问题规模根据实例生成的不同而有所变化。任务是对物品进行选择，以实现最大价值。
This dataset focuses on a combinatorial optimization problem, specifically the classic knapsack problem, whose objective is to maximize the total value of items contained in the knapsack without exceeding its capacity. The data instances are generated based on a fixed distribution, and the problem scale varies across different generated instances. The core task of this dataset is to select a subset of items to achieve the maximum total value.
