Research Article
Certificates of Optimality for Mixed Integer Linear Programming Using Generalized Subadditive Generator Functions
Table 4
Mixed integer knapsack problems.
| Problem | , | | Ratio | MILP time (s) | Certificate time (s) |
| nmipkn1.mps | 100, 100 | 10 | 0.07 | | | nmipkn3.mps | 500, 500 | 198 | 0.3 | | | nmipkn4.mps | 1000, 1000 | 270 | 0.19 | 0.86 | 0.03 | nmipkn5.mps | 5000, 5000 | 687 | 0.1 | 4.13 | 0.06 | nmipkn6.mps | 10000, 10000 | 1278 | 0.09 | 68.44 | 0.76 |
|
|