Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem

<table class="table-group" id="tab4"><tr><td><table class="table"><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr class="thead"><td class="align_left">Upper bound</td><td class="align_center">Sum of the best upper bound</td><td class="align_center">Percentage of the best upper bound (%)</td><td class="align_center">Sum of the best upper bounds equal to <i>B</i></td></tr><tr><td class="thead-hr" colspan="4"><hr/></td></tr><tr><td class="align_left"><i>U</i><sub>MT2</sub></td><td class="align_center">1520</td><td class="align_center">30.40</td><td class="align_center">1495</td></tr><tr><td class="align_left"><i>U</i><sub>MTM</sub></td><td class="align_center">1925</td><td class="align_center">38.50</td><td class="align_center">1548</td></tr><tr><td class="align_left"><i>U</i><sub><i>k</i>max</sub></td><td class="align_center">2025</td><td class="align_center">40.50</td><td class="align_center">2025</td></tr><tr><td class="align_left"><i>B</i></td><td class="align_center">4623</td><td class="align_center">92.46</td><td class="align_center">4623</td></tr><tr class="table-tr"><td colspan="4"><hr class="tbody-hr"/></td></tr></table></td></tr></table>

<div>Sum of the best upper bounds in 5000 instances.</div>

Computational Intelligence and Neuroscience

tab4

Table 4

Table 4: Fast Polynomial Time Approximate Solution for 0-1 Knapsack Problem 