Table 3 The 0-1 knapsack feasibility problem
From: A fixed point iterative approach to integer programming and its distributed computation
Prob. | n | The method | The best CPLEX strategy | ||
|---|---|---|---|---|---|
NumLPs | Feasibility | NumLPs | Feasibility | ||
1 | 1,000 | 1,002 | Feasible | 3,023 | Feasible |
2 | 1,000 | 1,010 | Feasible | 1,542 | Feasible |
3 | 1,000 | 1,027 | Feasible | 1,495 | Feasible |
4 | 1,000 | 1,011 | Feasible | 1,428 | Feasible |
5 | 1,000 | 1,118 | Feasible | 883 | Feasible |
6 | 1,000 | 1,035 | Feasible | 2,023 | Feasible |
7 | 1,000 | 1,000 | Infeasible | 1,280 | Infeasible |
8 | 1,000 | 1,002 | Feasible | 1,360 | Feasible |
9 | 1,000 | 1,002 | Feasible | 998 | Feasible |
10 | 1,000 | 1,013 | Feasible | 1,087 | Feasible |
11 | 1,000 | 1,321 | Feasible | 1,577 | Feasible |
12 | 1,000 | 1,003 | Feasible | 1,117 | Feasible |
13 | 1,000 | 1,024 | Feasible | 1,638 | Feasible |
14 | 1,000 | 1,005 | Feasible | 1,122 | Feasible |
15 | 1,000 | 1,019 | Feasible | 1,097 | Feasible |
16 | 1,000 | 1,007 | Feasible | 1,365 | Feasible |
17 | 1,000 | 999 | Infeasible | 1,315 | Infeasible |
18 | 1,000 | 1,572 | Feasible | 3,741 | Feasible |
19 | 1,000 | 1,031 | Feasible | 1,170 | Feasible |
20 | 1,000 | 1,015 | Feasible | 2,702 | Feasible |
21 | 1,000 | 1,002 | Feasible | 978 | Feasible |
22 | 1,000 | 1,007 | Feasible | 1,486 | Feasible |
23 | 1,000 | 1,005 | Feasible | 1,043 | Feasible |
24 | 1,000 | 1,001 | Feasible | 3,643 | Feasible |
25 | 1,000 | 1,065 | Feasible | 2,017 | Feasible |
26 | 1,000 | 1,016 | Feasible | 2,587 | Feasible |
27 | 1,000 | 1,014 | Feasible | 879 | Feasible |
28 | 1,000 | 1,012 | Feasible | 724 | Feasible |
29 | 1,000 | 1,303 | Feasible | 1,405 | Feasible |
30 | 1,000 | 1,025 | Feasible | 1,520 | Feasible |