Skip to main content
. 2022 Oct 22;2022:1266529. doi: 10.1155/2022/1266529

Table 5.

0/1 Knapsack problems.

No. (wi, pi) (i = 1, 2,…, 10000) C
1 i,i 2.6e + 07
2 (i, ln i+1) 2.7e + 07
3 (i, tan (πi/30000)) 2.8e + 07
4 (i, 100+10−4i2) 2.9e + 07
5 (i, 0.01i − 5600)2+1) 3.0e + 07
6 (i, i+tan (πi/30000)) 3.1e + 07
7 (i, tan (πi/30000)+0.001i2) 3.2e + 07
8 (i, 5000+10−6i3) 3.3e + 07
9 (i, tan (πi/30000)+10−6i3) 3.4e + 07
10 (i, arctan (0.01i)+1) 3.5e + 07
11 (i, 3 − lncos(10−4i)) 3.6e + 07
12 (i, arctan (10−4i2)+1) 3.7e + 07
13 (i, sin e10−4i+10−4i2) 3.8e + 07
14 (i, sin e10−4i+10−2i) 3.9e + 07
15 (i, (1/i)) 4.0e + 07
16 (i, (e10−4i+e−10−4i/sin (10−4i))) 4.1e + 07
17 (i, i2) 4.2e + 07
18 (i, i+2+εi), εi ~ [0,0.003] 4.3e + 07