Benchmark instances and results for the 0–1 Compartmentalized Knapsack Problem
收藏官方服务：
资源简介：
This dataset accompanies the paper “Compartmentalized Binary Knapsack Problem”. It contains the 240 instances used in the computational experiments, the instance generator, the OPL models, and the results obtained by the compact formulation MIP1 and by the Relax–Check–Cut algorithm (RCC), solved with IBM ILOG CPLEX 12.10. See README.md for the description of the files.
提供机构：
Zenodo创建时间：
2026-10-30
