Multidimensional Knapsack Problem
收藏DataCite Commons2025-09-23 更新2024-07-13 收录
下载链接：
https://research.lancaster-university.uk/en/datasets/35f154ce-7598-4b96-809b-2b007d40bbb8
下载链接
链接失效反馈官方服务：
资源简介：
The Multidimensional Knapsack Problem is a classic problem in combinatorial optimization, and several sets of benchmark instances exist. We give results for five of those sets. For each instance, we give the following: the optimal solution value (or best known lower bound), the upper bound from the linear programming relaxation, and the upper bound from the surrogate dual. More details can be found in the file "README.txt".Description
提供机构：
Lancaster University
创建时间：
2022-07-08
