Benchmarks
You may also want to:
Here, we collect solved instances of our portal's users. By allowing public publishing the results of your tasks,
they will automatically appear on the list.
All the computations are performed on the high-performance computer that is available at University of Ljubljana, Faculty of Mechanical Engineering.
There is an Intel Xeon X5670 (1536 hyper-cores) HPC cluster and an E5-2680 V3 (1008 hyper-cores) DP cluster, with IB QDR interconnection, 164 TB of LUSTRE storage,
4.6 TB RAM and with 24 TFlop/s performance.
|
Name
|
Function
|
Solution Type
|
Contributor
|
Nodes
|
Density
|
Solution
|
#Cores
|
Execution Time (s)
|
|
|
max cut 2021 06 03a (Graph_100_05_a)
Random graph on 100 nodes with density 0.05
|
Max-Cut
|
Optimal
|
jpovh
|
100
|
0.049
|
197
|
12
|
0.92
|
|
|
max cut 2021 06 03b (Graph_100_05_a)
Random graph on 100 nodes with density 0.05
|
Max-Cut
|
Approximate
|
jpovh
|
0
|
0
|
|
204
|
0
|
|
|
max cut 21 7 2021 (Graph_100_05_a)
Random graph on 100 nodes with density 0.05
|
Max-Cut
|
Optimal
|
jpovh
|
100
|
0.049
|
197
|
48
|
0.94
|
|
|
max cut bqp250-1 (Inst. of max cut bqp250-1)
|
Max-Cut
|
Approximate
|
jpovh
|
251
|
0.106
|
45607
|
48
|
58.03
|
|
|
Max Cut gka1a_new (Inst. of Max Cut gka1a_new)
|
Max-Cut
|
Optimal
|
jpovh
|
51
|
0.122
|
3414
|
12
|
1.1
|
|
|
Max Cut gka2a (Inst. of Max Cut gka2a)
|
Max-Cut
|
Optimal
|
jpovh
|
61
|
0.121
|
6063
|
12
|
0.19
|
|
|
Max Cut gka4a (Inst. of Max Cut gka4a)
|
Max-Cut
|
Optimal
|
jpovh
|
81
|
0.119
|
8598
|
12
|
1.05
|
|
|
MC 17 4 2019 (Inst. of Test max cut 21 2 2019 b)
|
Max-Cut
|
Optimal
|
jpovh
|
60
|
0.042
|
70
|
96
|
0.56
|
|
|
min cut example (Inst. of min cut example)
|
Max-Cut
|
Approximate
|
jpovh
|
101
|
1.011
|
4248
|
48
|
13.21
|
|
|
min cut example be100.9 (Inst. of min cut example be100.9)
|
Max-Cut
|
Approximate
|
jpovh
|
101
|
0.99
|
13294
|
48
|
10.27
|
|
|
min cut example nr 2 (Inst. of min cut example nr 2)
|
Max-Cut
|
Optimal
|
jpovh
|
101
|
0.991
|
15352
|
48
|
7.5
|
|
|
min cut example nr 3 - be 100.10 (Inst. of min cut example nr 3 - be 100.10)
|
Max-Cut
|
Optimal
|
jpovh
|
101
|
0.991
|
15352
|
48
|
7.51
|
|
|
solvebcc12174 (bcc12174.mc)
biconnected graph
|
Max-Cut
|
Optimal
|
mjuenger
Origin: mjuenger
|
63
|
0.456
|
538
|
48
|
0.06
|
|
|
solvebcc13285 (bcc13285.mc)
biconnected graph
|
Max-Cut
|
Optimal
|
mjuenger
Origin: mjuenger
|
63
|
0.501
|
602
|
48
|
0.04
|
|
|
solvebcc15386 (bcc15386.mc)
biconnected graph
|
Max-Cut
|
Optimal
|
mjuenger
Origin: mjuenger
|
63
|
0.806
|
900
|
48
|
0.04
|
|
|
solvebcc1615 (bcc1615.mc)
biconnected graph
|
Max-Cut
|
Optimal
|
mjuenger
Origin: mjuenger
|
41
|
0.429
|
199
|
48
|
0.04
|
|
|
solvebcc16601 (bcc16601.mc)
biconnected graph
|
Max-Cut
|
Optimal
|
mjuenger
Origin: mjuenger
|
160
|
0.191
|
2181
|
48
|
0.11
|
|
|
solvebcc17292 (bcc17292.mc)
biconnected graph
|
Max-Cut
|
Optimal
|
mjuenger
Origin: mjuenger
|
64
|
0.943
|
972
|
48
|
0.03
|
|
|
solvebcc21069 (bcc21069.mc)
biconnected graph
|
Max-Cut
|
Optimal
|
mjuenger
Origin: mjuenger
|
63
|
0.912
|
977
|
48
|
0.03
|
|
|
solvebcc23697 (bcc23697.mc)
biconnected graph
|
Max-Cut
|
Optimal
|
mjuenger
Origin: mjuenger
|
59
|
0.981
|
867
|
48
|
0.04
|
|