Skip to main content

Advertisement

Table 1 Two method to solve the knapsack feasibility problems

From: Solving the large-scale knapsack feasibility problem using a distributed computation approach to integer programming

Prob. Dimension n The method BC
NumLPs F NumLPs F
1 1000 1011 Feasible 1428 Feasible
2 1000 1035 Feasible 2023 Feasible
3 1000 1002 Feasible 1360 Feasible
4 1000 1003 Feasible 1117 Feasible
5 1000 1005 Feasible 1122 Feasible
6 1000 999 Infeasible 1315 Infeasible
7 1000 1002 Feasible 978 Feasible
8 1000 1007 Feasible 1486 Feasible
9 1000 1065 Feasible 2017 Feasible
10 1000 1016 Feasible 2587 Feasible
11 1000 1014 Feasible 879 Feasible
12 1000 1012 Feasible 724 Feasible