File name: kp_n_wmax
kp: name of the instance of 0/1 knapsack problem
n: number of items
wmax: knapsack capacity
Example
n wmax
v1 w1
v2 w2
: :
vi wi
: :
vn wn
vi: profit of item i
wi: weight of item i
Download datasets of low-dimesional and large-scale 0/1 knapsack problems
file | Optimum |
---|---|
f1_l-d_kp_10_269 | 295 |
f2_l-d_kp_20_878 | 1024 |
f3_l-d_kp_4_20 | 35 |
f4_l-d_kp_4_11 | 23 |
f5_l-d_kp_15_375 | 481,0694 |
f6_l-d_kp_10_60 | 52 |
f7_l-d_kp_7_50 | 107 |
f8_l-d_kp_23_10000 | 9767 |
f9_l-d_kp_5_80 | 130 |
f10_l-d_kp_20_879 | 1025 |
The large scale instances of 0/1 knapsack problem are describe in "Pisinger, D., Where are the hard knapsack problems? Computers & Operations Research, 2005. 32(9): p. 2271-2284"
More large scale 0/1 knapsack problems visit David Pisinger's optimization codes
file | Optimum |
---|---|
knapPI_1_100_1000_1 | 9147 |
knapPI_1_200_1000_1 | 11238 |
knapPI_1_500_1000_1 | 28857 |
knapPI_1_1000_1000_1 | 54503 |
knapPI_1_2000_1000_1 | 110625 |
knapPI_1_5000_1000_1 | 276457 |
knapPI_1_10000_1000_1 | 563647 |
file | Optimum |
---|---|
knapPI_2_100_1000_1 | 1514 |
knapPI_2_200_1000_1 | 1634 |
knapPI_2_500_1000_1 | 4566 |
knapPI_2_1000_1000_1 | 9052 |
knapPI_2_2000_1000_1 | 18051 |
knapPI_2_5000_1000_1 | 44356 |
knapPI_2_10000_1000_1 | 90204 |
file | Optimum |
---|---|
knapPI_3_100_1000_1 | 2397 |
knapPI_3_200_1000_1 | 2697 |
knapPI_3_500_1000_1 | 7117 |
knapPI_3_1000_1000_1 | 14390 |
knapPI_3_2000_1000_1 | 28919 |
knapPI_3_5000_1000_1 | 72505 |
knapPI_3_10000_1000_1 | 146919 |