Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem

Table 2

Weights and profits of knapsack problems from Pisinger’s paper [20].

No.	(, ) (i = 1, 2, …, 10^4)	No.	(, ) (i = 1, 2, …, 10^4)
1		2
3		4
5		6
7		8
9		10

Note. u_i and are uniformly distributed in [0,1]. R = 10³, 10⁴, 10⁵, 10⁶ or 10⁷.