Mixed-Integer Linear Programming (MILP) solving on Multiple Knapsack Transfer
44.29Geometric Mean Execution TimeSCIP default
Evaluation Results
| Method | Links | |||
|---|---|---|---|---|
| SCIP defaultNode limit=200,000, Seeds=5, Distribution=Transfer2023.06 | 44.29 | 2.66 | — | |
| TreeDQNNode limit=200,000, Seeds=5, Distribution=Transfer2023.06 | 302.43 | 4.91 | — | |
| TreeDQN (per)Node limit=200,000, Seeds=5, Distribution=Transfer2023.06 | 310.56 | 5.01 | — | |
| tMDP+DFSNode limit=200,000, Seeds=5, Distribution=Transfer2023.06 | 358.44 | 5.65 | — | |
| FMSTSNode limit=200,000, Seeds=5, Distribution=Transfer2023.06 | 372.56 | 5.12 | — | |
| ILNode limit=200,000, Seeds=5, Distribution=Transfer2023.06 | 514 | 5.26 | — | |
| W(FMSTS)Node limit=200,000, Seeds=5, Distribution=Transfer2023.06 | — | — | 4.99 | |
| W(IL)Node limit=200,000, Seeds=5, Distribution=Transfer2023.06 | — | — | 1.78 | |
| W(per)Node limit=200,000, Seeds=5, Distribution=Transfer2023.06 | — | — | 1.29 | |
| W(tMDP+DFS)Node limit=200,000, Seeds=5, Distribution=Transfer2023.06 | — | — | 3.22 |