Solving linear programming instances on Multi-dimensional knapsack linear programming (test)
274.78Average Optimal ValueDC3
Evaluation results
| Method | Links | ||||
|---|---|---|---|---|---|
| DC3m=30, n=5002024.02 | 274.78 | — | 7.91 | 277.4 | |
| DC3m=30, n=2002024.02 | 255.24 | — | 8.42 | 259.25 | |
| DC3m=30, n=1002024.02 | 159.49 | — | 5.54 | 166.31 | |
| DC3m=10, n=5002024.02 | 100.04 | — | 3.38 | 104 | |
| DC3m=10, n=1002024.02 | 41.85 | — | 2.51 | 69.58 | |
| DC3m=10, n=2002024.02 | 36.88 | — | 2.28 | 100.9 | |
| DC3m=5, n=5002024.02 | 33.7 | — | 1.29 | 41.54 | |
| DC3m=5, n=2002024.02 | 20.58 | — | 1.41 | 49.47 | |
| DC3m=5, n=1002024.02 | 19.58 | — | 1.86 | 41.42 | |
| DLLm=30, n=1002024.02 | 1.93 | — | 0.37 | 3.31 | |
| DLLm=30, n=2002024.02 | 0.96 | — | 0.2 | 1.83 | |
| DLLm=10, n=1002024.02 | 0.68 | — | 0.25 | 2.15 | |
| DLLm=30, n=5002024.02 | 0.38 | — | 0.09 | 0.75 | |
| DLLm=5, n=1002024.02 | 0.36 | — | 0.2 | 1.36 | |
| DLLm=10, n=2002024.02 | 0.34 | — | 0.13 | 0.96 | |
| DLLm=5, n=2002024.02 | 0.18 | — | 0.1 | 0.84 | |
| DLLm=10, n=5002024.02 | 0.14 | — | 0.06 | 0.46 | |
| DLLm=5, n=5002024.02 | 0.07 | — | 0.04 | 0.3 | |
| Gurobim=5, n=1002024.02 | — | 14,811.9 | — | — | |
| Gurobim=5, n=2002024.02 | — | 29,660.4 | — | — | |
| Gurobim=5, n=5002024.02 | — | 74,267 | — | — | |
| Gurobim=10, n=1002024.02 | — | 14,675.8 | — | — | |
| Gurobim=10, n=2002024.02 | — | 29,450.7 | — | — | |
| Gurobim=10, n=5002024.02 | — | 73,777.5 | — | — | |
| Gurobim=30, n=1002024.02 | — | 14,441.5 | — | — | |
| Gurobim=30, n=2002024.02 | — | 29,156.1 | — | — | |
| Gurobim=30, n=5002024.02 | — | 73,314.3 | — | — |