Share your thoughts, 1 month free Claude Pro on us
See more
Home
/
Benchmarks
Mixed Integer Linear Programming (MILP) solving on ML4CO Balanced Item Placement (test)
Loading...
5,958.06
Reward
TreeDQN
3,317.4376
4,002.9838
4,688.53
5,374.0762
Jun 9, 2023
Reward
Primal Bound
Dual Bound
# Nodes (x10^3)
# LPs (x10^3)
Updated 12d ago
Evaluation Results
Method
Method
Links
Reward
Primal Bound
Dual Bound
# Nodes (x10^3)
# LPs (x10^3)
TreeDQN
2023.06
5,958.06
87.33
7.05
83.76
846.4
IL
2023.06
4,964.77
537.85
5.92
141.36
1,911.16
SCIP default
2023.06
3,885.24
18.46
4.97
258.36
5,037.1
Strong Branching
2023.06
3,419
628.02
4.01
0.552
13.95
Feedback
Search any
task
Search any
task