Set covering
Benchmarks
| Task Name | Dataset Name | SOTA Result | Trend | |
|---|---|---|---|---|
| Combinatorial Optimization | Set Covering Small s | Time (s)3.7 | 18 | |
| Mixed-Integer Linear Programming solving | Set Covering 1000x500 (Easy) | Search Nodes16.64 | 13 | |
| Combinatorial Optimization | Set Covering Large l | Computation Time36.8 | 12 | |
| Combinatorial Optimization | Set Covering Medium | Time14.1 | 12 | |
| MILP Solving | Set covering transfer larger size | Nodes Explored61.4 | 10 | |
| MILP Solving | Set covering same size as training (test) | Search Tree Nodes10.7 | 10 | |
| Set Covering | Set Covering D6 | Time (s)900 | 9 | |
| Set Covering | Set Covering D5 | Time (s)900 | 9 | |
| Set Covering | Set Covering D4 | Time (s)900 | 9 | |
| Set Covering | Set Covering D3 | Time (s)831.41 | 9 | |
| Set Covering | Set Covering D2 | Time (s)73.78 | 9 | |
| Set Covering | Set Covering D1 | Time (s)6.28 | 9 | |
| MILP solving | Set covering Transfer | Search Tree Nodes672.1 | 9 | |
| MILP solving | Set covering (train) | Search Tree Nodes35.8 | 9 | |
| Set Covering | Set Covering Large Problems | Solved Count69 | 6 | |
| Set Covering | Set Covering Medium Problems | Solution Rate100 | 6 | |
| Mixed-Integer Linear Programming solving | Set Covering 1000x2000 (Hard) | Nodes Explored426 | 4 | |
| Mixed-Integer Linear Programming solving | Set Covering 1000x1000 (Medium) | Nodes Explored370 | 4 | |
| MILP Branching | Set Covering D6 | Time (s)900 | 3 | |
| MILP Branching | Set Covering D5 | Time (s)900 | 3 | |
| MILP Branching | Set Covering D4 | Time (s)900 | 3 | |
| MILP Branching | Set Covering D3 | Execution Time (s)839.8 | 3 | |
| MILP Branching | Set Covering D2 | Execution Time (s)72.51 | 3 | |
| MILP Branching | Set Covering D1 | Execution Time (s)6.12 | 3 |
Showing 24 of 24 rows