Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem

Table 6

Approximate value and optimization value of 0/1 Knapsack problems.

No.	Approximate value	Optimal value
1	4.082159596963170e + 05	4.082159596963174e + 05
2	6.541219347026785e + 04	6.541219347026781e + 04
3	4.102160742890480e + 03	4.102160742890481e + 03
4	2.462154058619999e + 07	2.462154058620000e + 07
5	8.338180285999998e + 08	8.338180286000001e + 08
6	3.100447382723671e + 07	3.100447382723672e + 07
7	2.613912845586523e + 07	2.613912845586526e + 07
8	2.232528710024500e + 09	2.232528710024500e + 09
9	2.244286940564110e + 09	2.244286940564110e + 09
10	2.096538351264514e + 04	2.096538351264514e + 04
11	2.655627458756987e + 04	2.655627458756988e + 04
12	2.189122733748200e + 04	2.189122733748204e + 04
13	2.942021969836180e + 07	2.942021969836181e + 07
14	3.981146835799920e + 05	3.981146835799920e + 05
15	9.675897955855723	9.675897955855723
16	1.997554888239176e + 05	1.997554888239177e + 05
17	3.120269950000000e + 11	3.120269950000000e + 11
18	4.301855990805434e + 07	4.301855990837396e + 07