=====================
USING MODEL: mub1
=====================
Solving problem with n=5 m=3 scen=1 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 117
72 MIP simplex iterations
9 branch-and-bound nodes
1 flow-cover cut
1 Gomory cut
Solving problem with n=5 m=3 scen=1 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.25
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 213
193 MIP simplex iterations
30 branch-and-bound nodes
5 flow-cover cuts
2 Gomory cuts
Solving problem with n=5 m=3 scen=1 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 102
28 MIP simplex iterations
0 branch-and-bound nodes
1 flow-cover cut
1 Gomory cut
Solving problem with n=5 m=3 scen=1 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 169
105 MIP simplex iterations
8 branch-and-bound nodes
4 flow-cover cuts
1 Gomory cut
1 implied-bound cut
Solving problem with n=5 m=3 scen=1 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 165
71 MIP simplex iterations
3 branch-and-bound nodes
absmipgap = 1.98952e-13, relmipgap = 1.20577e-15
2 flow-cover cuts
1 Gomory cut
1 implied-bound cut
Solving problem with n=5 m=3 scen=1 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.1
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 111
116 MIP simplex iterations
10 branch-and-bound nodes
4 Gomory cuts
Solving problem with n=5 m=3 scen=1 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.09
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 117
49 MIP simplex iterations
3 branch-and-bound nodes
1 flow-cover cut
2 Gomory cuts
Solving problem with n=5 m=3 scen=1 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 290
95 MIP simplex iterations
15 branch-and-bound nodes
4 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
Solving problem with n=5 m=3 scen=1 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 61
31 MIP simplex iterations
0 branch-and-bound nodes
8 flow-cover cuts
2 implied-bound cuts
Solving problem with n=5 m=3 scen=1 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.06
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 100
94 MIP simplex iterations
7 branch-and-bound nodes
1 flow-cover cut
3 Gomory cuts
Solving problem with n=5 m=3 scen=2 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.02
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 43
116 MIP simplex iterations
11 branch-and-bound nodes
1 Gomory cut
Solving problem with n=5 m=3 scen=2 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 165
191 MIP simplex iterations
23 branch-and-bound nodes
2 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
Solving problem with n=5 m=3 scen=2 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.06
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 71
93 MIP simplex iterations
8 branch-and-bound nodes
6 flow-cover cuts
1 Gomory cut
Solving problem with n=5 m=3 scen=2 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.02
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 102
154 MIP simplex iterations
12 branch-and-bound nodes
3 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
Solving problem with n=5 m=3 scen=2 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 196
165 MIP simplex iterations
30 branch-and-bound nodes
2 flow-cover cuts
2 Gomory cuts
4 implied-bound cuts
Solving problem with n=5 m=3 scen=2 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 107
111 MIP simplex iterations
11 branch-and-bound nodes
5 flow-cover cuts
2 Gomory cuts
Solving problem with n=5 m=3 scen=2 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.02
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 153
110 MIP simplex iterations
7 branch-and-bound nodes
4 flow-cover cuts
3 Gomory cuts
1 implied-bound cut
Solving problem with n=5 m=3 scen=2 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.06
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 251
119 MIP simplex iterations
14 branch-and-bound nodes
1 Gomory cut
4 implied-bound cuts
Solving problem with n=5 m=3 scen=2 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.02
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 62
158 MIP simplex iterations
13 branch-and-bound nodes
7 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
Solving problem with n=5 m=3 scen=2 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 86
278 MIP simplex iterations
32 branch-and-bound nodes
4 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
Solving problem with n=5 m=3 scen=3 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 210
59 MIP simplex iterations
6 branch-and-bound nodes
4 flow-cover cuts
1 Gomory cut
Solving problem with n=5 m=3 scen=3 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.1
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 318
197 MIP simplex iterations
26 branch-and-bound nodes
4 flow-cover cuts
1 Gomory cut
Solving problem with n=5 m=3 scen=3 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 250
65 MIP simplex iterations
3 branch-and-bound nodes
1 flow-cover cut
3 Gomory cuts
3 implied-bound cuts
Solving problem with n=5 m=3 scen=3 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.14
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 393
237 MIP simplex iterations
29 branch-and-bound nodes
9 flow-cover cuts
1 Gomory cut
1 implied-bound cut
Solving problem with n=5 m=3 scen=3 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 212
107 MIP simplex iterations
15 branch-and-bound nodes
3 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
Solving problem with n=5 m=3 scen=3 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 268
48 MIP simplex iterations
4 branch-and-bound nodes
3 flow-cover cuts
2 Gomory cuts
Solving problem with n=5 m=3 scen=3 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 383
0 MIP simplex iterations
0 branch-and-bound nodes
Solving problem with n=5 m=3 scen=3 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.05
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 447
174 MIP simplex iterations
28 branch-and-bound nodes
8 flow-cover cuts
1 Gomory cut
1 implied-bound cut
Solving problem with n=5 m=3 scen=3 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.02
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 230
154 MIP simplex iterations
10 branch-and-bound nodes
7 flow-cover cuts
1 implied-bound cut
Solving problem with n=5 m=3 scen=3 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 280
159 MIP simplex iterations
14 branch-and-bound nodes
4 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
Solving problem with n=5 m=3 scen=4 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.02
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 108
83 MIP simplex iterations
5 branch-and-bound nodes
2 flow-cover cuts
2 Gomory cuts
2 implied-bound cuts
Solving problem with n=5 m=3 scen=4 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.06
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 269
147 MIP simplex iterations
13 branch-and-bound nodes
4 flow-cover cuts
2 Gomory cuts
Solving problem with n=5 m=3 scen=4 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 199
149 MIP simplex iterations
21 branch-and-bound nodes
4 flow-cover cuts
2 Gomory cuts
4 implied-bound cuts
Solving problem with n=5 m=3 scen=4 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.02
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 340
257 MIP simplex iterations
20 branch-and-bound nodes
10 flow-cover cuts
1 Gomory cut
1 implied-bound cut
Solving problem with n=5 m=3 scen=4 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.03
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 277
278 MIP simplex iterations
39 branch-and-bound nodes
5 flow-cover cuts
2 Gomory cuts
4 implied-bound cuts
Solving problem with n=5 m=3 scen=4 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.01
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 408
95 MIP simplex iterations
9 branch-and-bound nodes
3 flow-cover cuts
3 Gomory cuts
Solving problem with n=5 m=3 scen=4 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.04
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 471
79 MIP simplex iterations
11 branch-and-bound nodes
2 flow-cover cuts
2 Gomory cuts
2 implied-bound cuts
Solving problem with n=5 m=3 scen=4 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.02
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 417
220 MIP simplex iterations
36 branch-and-bound nodes
3 flow-cover cuts
2 Gomory cuts
5 implied-bound cuts
Solving problem with n=5 m=3 scen=4 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.02
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 129
287 MIP simplex iterations
27 branch-and-bound nodes
5 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
Solving problem with n=5 m=3 scen=4 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.06
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 249
166 MIP simplex iterations
23 branch-and-bound nodes
7 flow-cover cuts
2 implied-bound cuts
Solving problem with n=10 m=3 scen=1 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.08
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 371
1476 MIP simplex iterations
130 branch-and-bound nodes
2 flow-cover cuts
3 Gomory cuts
Solving problem with n=10 m=3 scen=1 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.69
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 396
4466 MIP simplex iterations
523 branch-and-bound nodes
absmipgap = 9.69749e-11, relmipgap = 2.44886e-13
1 flow-cover cut
5 Gomory cuts
15 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=1 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.67
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 391
7174 MIP simplex iterations
582 branch-and-bound nodes
6 flow-cover cuts
1 Gomory cut
Solving problem with n=10 m=3 scen=1 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.12
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 388
2919 MIP simplex iterations
375 branch-and-bound nodes
2 flow-cover cuts
3 Gomory cuts
Solving problem with n=10 m=3 scen=1 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.04
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 496
924 MIP simplex iterations
81 branch-and-bound nodes
2 flow-cover cuts
2 Gomory cuts
Solving problem with n=10 m=3 scen=1 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.28
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 358
663 MIP simplex iterations
105 branch-and-bound nodes
3 flow-cover cuts
1 Gomory cut
Solving problem with n=10 m=3 scen=1 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.71
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 358
9032 MIP simplex iterations
616 branch-and-bound nodes
1 flow-cover cut
6 Gomory cuts
13 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=1 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.49
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 809
2020 MIP simplex iterations
397 branch-and-bound nodes
1 Gomory cut
Solving problem with n=10 m=3 scen=1 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.14
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 336
3641 MIP simplex iterations
311 branch-and-bound nodes
1 flow-cover cut
4 Gomory cuts
Solving problem with n=10 m=3 scen=1 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.24
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 252
2053 MIP simplex iterations
181 branch-and-bound nodes
3 flow-cover cuts
2 Gomory cuts
Solving problem with n=10 m=3 scen=2 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.35
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 147
3763 MIP simplex iterations
253 branch-and-bound nodes
8 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
Solving problem with n=10 m=3 scen=2 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.64
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 200
8794 MIP simplex iterations
561 branch-and-bound nodes
absmipgap = 8.52651e-14, relmipgap = 4.26326e-16
6 Gomory cuts
20 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=2 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.7
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 421
32500 MIP simplex iterations
1116 branch-and-bound nodes
7 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
61 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=2 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.83
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 211
10743 MIP simplex iterations
539 branch-and-bound nodes
1 Gomory cut
1 implied-bound cut
36 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=2 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.03
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 546
11955 MIP simplex iterations
885 branch-and-bound nodes
3 flow-cover cuts
1 Gomory cut
15 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=2 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.42
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 247
5742 MIP simplex iterations
565 branch-and-bound nodes
1 flow-cover cut
6 Gomory cuts
6 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=2 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.63
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 106
7434 MIP simplex iterations
481 branch-and-bound nodes
3 flow-cover cuts
Solving problem with n=10 m=3 scen=2 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.26
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 381
6432 MIP simplex iterations
514 branch-and-bound nodes
1 flow-cover cut
5 Gomory cuts
Solving problem with n=10 m=3 scen=2 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.9
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 205
10534 MIP simplex iterations
563 branch-and-bound nodes
31 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=2 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.28
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 117
8387 MIP simplex iterations
413 branch-and-bound nodes
5 flow-cover cuts
1 Gomory cut
Solving problem with n=10 m=3 scen=3 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.45
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 722
5807 MIP simplex iterations
497 branch-and-bound nodes
4 flow-cover cuts
2 Gomory cuts
Solving problem with n=10 m=3 scen=3 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.63
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 565
6689 MIP simplex iterations
558 branch-and-bound nodes
absmipgap = 1.0175e-10, relmipgap = 1.80088e-13
2 flow-cover cuts
2 Gomory cuts
20 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=3 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  1.08
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 865
20026 MIP simplex iterations
1026 branch-and-bound nodes
absmipgap = 3.41061e-11, relmipgap = 3.9429e-14
15 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
60 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=3 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.23
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 553
2853 MIP simplex iterations
286 branch-and-bound nodes
8 flow-cover cuts
4 Gomory cuts
1 implied-bound cut
Solving problem with n=10 m=3 scen=3 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.49
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 873
6161 MIP simplex iterations
632 branch-and-bound nodes
2 flow-cover cuts
8 Gomory cuts
7 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=3 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.42
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 497
1877 MIP simplex iterations
330 branch-and-bound nodes
3 flow-cover cuts
1 Gomory cut
Solving problem with n=10 m=3 scen=3 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.63
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 623
8275 MIP simplex iterations
762 branch-and-bound nodes
1 flow-cover cut
1 Gomory cut
15 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=3 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.31
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 809
2266 MIP simplex iterations
424 branch-and-bound nodes
1 flow-cover cut
1 Gomory cut
Solving problem with n=10 m=3 scen=3 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.17
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 424
4786 MIP simplex iterations
448 branch-and-bound nodes
3 flow-cover cuts
2 Gomory cuts
Solving problem with n=10 m=3 scen=3 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.88
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 463
8881 MIP simplex iterations
571 branch-and-bound nodes
absmipgap = 1.52909e-11, relmipgap = 3.30257e-14
1 flow-cover cut
5 Gomory cuts
11 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=4 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.68
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 720
11193 MIP simplex iterations
726 branch-and-bound nodes
6 flow-cover cuts
5 Gomory cuts
2 implied-bound cuts
34 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=4 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.49
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 299
8839 MIP simplex iterations
553 branch-and-bound nodes
2 flow-cover cuts
3 Gomory cuts
3 implied-bound cuts
27 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=4 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.25
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1036
13780 MIP simplex iterations
713 branch-and-bound nodes
20 flow-cover cuts
2 Gomory cuts
3 implied-bound cuts
25 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=4 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.64
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 496
10164 MIP simplex iterations
595 branch-and-bound nodes
16 flow-cover cuts
1 Gomory cut
8 implied-bound cuts
Solving problem with n=10 m=3 scen=4 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.03
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 1285
7777 MIP simplex iterations
768 branch-and-bound nodes
7 flow-cover cuts
5 Gomory cuts
2 implied-bound cuts
27 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=4 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.45
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 249
5696 MIP simplex iterations
546 branch-and-bound nodes
1 flow-cover cut
6 Gomory cuts
6 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=4 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  1.35
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 424
19921 MIP simplex iterations
1207 branch-and-bound nodes
11 flow-cover cuts
3 Gomory cuts
2 implied-bound cuts
19 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=4 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.78
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 394
8602 MIP simplex iterations
545 branch-and-bound nodes
2 flow-cover cuts
7 Gomory cuts
11 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=4 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  1.66
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 202
11454 MIP simplex iterations
604 branch-and-bound nodes
2 Gomory cuts
33 mixed-integer rounding cuts
Solving problem with n=10 m=3 scen=4 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.33
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 427
19027 MIP simplex iterations
718 branch-and-bound nodes
6 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
46 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=1 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  1.88
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 659
23976 MIP simplex iterations
1126 branch-and-bound nodes
1 flow-cover cut
3 Gomory cuts
30 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=1 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.36
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 786
28777 MIP simplex iterations
1407 branch-and-bound nodes
1 flow-cover cut
5 Gomory cuts
16 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=1 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.32
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 685
20952 MIP simplex iterations
789 branch-and-bound nodes
1 flow-cover cut
1 Gomory cut
30 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=1 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1241
25494 MIP simplex iterations
1208 branch-and-bound nodes
1 flow-cover cut
2 Gomory cuts
40 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=1 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.76
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 930
20838 MIP simplex iterations
882 branch-and-bound nodes
2 flow-cover cuts
3 Gomory cuts
23 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=1 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.27
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 238
6083 MIP simplex iterations
249 branch-and-bound nodes
5 flow-cover cuts
2 Gomory cuts
Solving problem with n=10 m=7 scen=1 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.03
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1477
28383 MIP simplex iterations
1020 branch-and-bound nodes
11 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
50 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=1 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.19
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 296
4107 MIP simplex iterations
170 branch-and-bound nodes
2 flow-cover cuts
2 Gomory cuts
Solving problem with n=10 m=7 scen=1 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.08
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 734
24383 MIP simplex iterations
1281 branch-and-bound nodes
absmipgap = 2.50111e-12, relmipgap = 3.40751e-15
1 flow-cover cut
5 Gomory cuts
28 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=1 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.93
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 985
24430 MIP simplex iterations
973 branch-and-bound nodes
4 flow-cover cuts
6 Gomory cuts
19 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=2 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.56
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1001
36366 MIP simplex iterations
1426 branch-and-bound nodes
absmipgap = 6.82121e-13, relmipgap = 6.8144e-16
7 flow-cover cuts
3 Gomory cuts
3 implied-bound cuts
72 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=2 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.98
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1163
34012 MIP simplex iterations
1297 branch-and-bound nodes
8 flow-cover cuts
2 Gomory cuts
2 implied-bound cuts
44 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=2 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  3.31
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 919
50006 MIP simplex iterations
1490 branch-and-bound nodes
11 flow-cover cuts
1 Gomory cut
1 implied-bound cut
90 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=2 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.47
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1574
17825 MIP simplex iterations
953 branch-and-bound nodes
absmipgap = 2.27374e-13, relmipgap = 1.44456e-16
3 flow-cover cuts
8 Gomory cuts
26 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=2 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  2.63
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 987
36548 MIP simplex iterations
1475 branch-and-bound nodes
10 flow-cover cuts
3 Gomory cuts
1 implied-bound cut
35 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=2 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.55
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 144
13683 MIP simplex iterations
437 branch-and-bound nodes
8 flow-cover cuts
Solving problem with n=10 m=7 scen=2 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.56
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2021
12746 MIP simplex iterations
520 branch-and-bound nodes
13 flow-cover cuts
1 Gomory cut
1 implied-bound cut
Solving problem with n=10 m=7 scen=2 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.36
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 212
20860 MIP simplex iterations
572 branch-and-bound nodes
1 flow-cover cut
1 Gomory cut
47 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=2 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.53
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 701
26202 MIP simplex iterations
846 branch-and-bound nodes
5 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
75 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=2 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.97
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1309
25964 MIP simplex iterations
961 branch-and-bound nodes
9 flow-cover cuts
2 Gomory cuts
2 implied-bound cuts
52 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=3 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.87
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1805
25306 MIP simplex iterations
1475 branch-and-bound nodes
3 flow-cover cuts
5 Gomory cuts
2 implied-bound cuts
64 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=3 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.68
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1748
25291 MIP simplex iterations
1169 branch-and-bound nodes
9 flow-cover cuts
9 Gomory cuts
1 implied-bound cut
43 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=3 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.07
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1936
64881 MIP simplex iterations
2367 branch-and-bound nodes
absmipgap = 0.026621, relmipgap = 1.37505e-05
7 flow-cover cuts
4 Gomory cuts
2 implied-bound cuts
80 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=3 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.28
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2468
14393 MIP simplex iterations
744 branch-and-bound nodes
absmipgap = 4.54747e-13, relmipgap = 1.84257e-16
3 Gomory cuts
28 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=3 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.78
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1940
38473 MIP simplex iterations
1558 branch-and-bound nodes
21 flow-cover cuts
2 Gomory cuts
2 implied-bound cuts
58 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=3 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.79
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 892
56647 MIP simplex iterations
2000 branch-and-bound nodes
absmipgap = 0.0264191, relmipgap = 2.96178e-05
1 flow-cover cut
3 Gomory cuts
42 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=3 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.69
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2370
18442 MIP simplex iterations
738 branch-and-bound nodes
absmipgap = 6.36646e-12, relmipgap = 2.68627e-15
11 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
49 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=3 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.34
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1193
6710 MIP simplex iterations
458 branch-and-bound nodes
10 flow-cover cuts
4 Gomory cuts
1 implied-bound cut
Solving problem with n=10 m=7 scen=3 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.18
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1734
45716 MIP simplex iterations
2005 branch-and-bound nodes
7 flow-cover cuts
3 Gomory cuts
2 implied-bound cuts
73 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=3 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.81
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2197
15262 MIP simplex iterations
627 branch-and-bound nodes
12 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
Solving problem with n=10 m=7 scen=4 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.72
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2270
27601 MIP simplex iterations
1547 branch-and-bound nodes
8 flow-cover cuts
3 Gomory cuts
2 implied-bound cuts
62 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=4 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  1.97
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2245
32511 MIP simplex iterations
1670 branch-and-bound nodes
absmipgap = 4.54747e-13, relmipgap = 2.0256e-16
1 flow-cover cut
3 Gomory cuts
29 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=4 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.15
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2152
57739 MIP simplex iterations
2061 branch-and-bound nodes
3 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
83 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=4 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  1.19
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 3096
14051 MIP simplex iterations
732 branch-and-bound nodes
absmipgap = 9.09495e-13, relmipgap = 2.93764e-16
2 flow-cover cuts
3 Gomory cuts
26 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=4 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  2.34
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2141
30018 MIP simplex iterations
1250 branch-and-bound nodes
2 flow-cover cuts
2 Gomory cuts
42 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=4 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.65
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 234
25328 MIP simplex iterations
614 branch-and-bound nodes
9 flow-cover cuts
2 implied-bound cuts
74 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=4 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.98
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 3194
24657 MIP simplex iterations
1030 branch-and-bound nodes
3 flow-cover cuts
2 Gomory cuts
30 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=4 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  0.64
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1183
6331 MIP simplex iterations
438 branch-and-bound nodes
5 flow-cover cuts
3 Gomory cuts
2 implied-bound cuts
Solving problem with n=10 m=7 scen=4 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  2.27
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1667
24896 MIP simplex iterations
1007 branch-and-bound nodes
absmipgap = 7.04858e-12, relmipgap = 4.2283e-15
3 Gomory cuts
44 mixed-integer rounding cuts
Solving problem with n=10 m=7 scen=4 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.05
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 2845
30887 MIP simplex iterations
1237 branch-and-bound nodes
5 flow-cover cuts
2 Gomory cuts
33 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=1 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.53
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 707
46418 MIP simplex iterations
1227 branch-and-bound nodes
absmipgap = 5.68434e-13, relmipgap = 8.04009e-16
7 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
91 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=1 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  9.62
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1643
193784 MIP simplex iterations
6449 branch-and-bound nodes
absmipgap = 0.0912064, relmipgap = 5.55121e-05
14 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
58 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=1 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  5.2
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1200
70314 MIP simplex iterations
2538 branch-and-bound nodes
3 flow-cover cuts
1 Gomory cut
32 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=1 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.78
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 681
54816 MIP simplex iterations
1236 branch-and-bound nodes
1 flow-cover cut
2 Gomory cuts
32 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=1 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.54
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1529
52755 MIP simplex iterations
1919 branch-and-bound nodes
absmipgap = 0.14782, relmipgap = 9.66777e-05
2 flow-cover cuts
5 Gomory cuts
27 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=1 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  2.88
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1162
38411 MIP simplex iterations
1242 branch-and-bound nodes
1 flow-cover cut
2 Gomory cuts
41 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=1 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.04
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1609
36554 MIP simplex iterations
1233 branch-and-bound nodes
absmipgap = 4.54747e-13, relmipgap = 2.82627e-16
6 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
82 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=1 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.42
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 912
30644 MIP simplex iterations
1051 branch-and-bound nodes
6 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
38 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=1 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  3.59
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 908
53377 MIP simplex iterations
1313 branch-and-bound nodes
5 flow-cover cuts
3 Gomory cuts
28 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=1 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.86
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1621
59597 MIP simplex iterations
2147 branch-and-bound nodes
5 Gomory cuts
40 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=2 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  7.17
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 1015
128786 MIP simplex iterations
2489 branch-and-bound nodes
24 flow-cover cuts
1 implied-bound cut
129 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=2 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  6.54
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1540
105255 MIP simplex iterations
3357 branch-and-bound nodes
13 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
87 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=2 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.93
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1932
57939 MIP simplex iterations
2130 branch-and-bound nodes
1 flow-cover cut
2 Gomory cuts
38 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=2 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  5.33
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 551
110422 MIP simplex iterations
2415 branch-and-bound nodes
11 flow-cover cuts
1 Gomory cut
3 implied-bound cuts
41 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=2 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  6.27
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1664
97238 MIP simplex iterations
3092 branch-and-bound nodes
absmipgap = 0.141529, relmipgap = 8.50533e-05
7 flow-cover cuts
3 Gomory cuts
2 implied-bound cuts
62 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=2 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.77
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1428
47713 MIP simplex iterations
1526 branch-and-bound nodes
absmipgap = 9.09495e-13, relmipgap = 6.36901e-16
4 flow-cover cuts
2 Gomory cuts
39 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=2 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.6
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1754
27090 MIP simplex iterations
984 branch-and-bound nodes
10 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
71 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=2 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  5.07
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1162
96809 MIP simplex iterations
2308 branch-and-bound nodes
14 flow-cover cuts
2 implied-bound cuts
59 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=2 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  2.09
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 490
26396 MIP simplex iterations
567 branch-and-bound nodes
1 flow-cover cut
2 Gomory cuts
23 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=2 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.99
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2145
69643 MIP simplex iterations
2366 branch-and-bound nodes
10 flow-cover cuts
2 Gomory cuts
2 implied-bound cuts
89 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=3 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  3.81
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2076
37902 MIP simplex iterations
1027 branch-and-bound nodes
11 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
80 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=3 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  9.55
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2652
151494 MIP simplex iterations
5354 branch-and-bound nodes
absmipgap = 0.186529, relmipgap = 7.03354e-05
16 flow-cover cuts
2 Gomory cuts
3 implied-bound cuts
65 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=3 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  4.52
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2782
57725 MIP simplex iterations
2098 branch-and-bound nodes
1 flow-cover cut
1 Gomory cut
35 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=3 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.55
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1994
56818 MIP simplex iterations
1638 branch-and-bound nodes
5 flow-cover cuts
5 Gomory cuts
1 implied-bound cut
94 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=3 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.48
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2619
60093 MIP simplex iterations
1882 branch-and-bound nodes
7 flow-cover cuts
5 Gomory cuts
3 implied-bound cuts
83 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=3 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  6.48
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2593
90387 MIP simplex iterations
3078 branch-and-bound nodes
absmipgap = 0.181904, relmipgap = 7.01519e-05
13 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
86 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=3 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.5
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2855
9399 MIP simplex iterations
444 branch-and-bound nodes
8 flow-cover cuts
3 Gomory cuts
Solving problem with n=10 m=10 scen=3 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  5.27
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2496
86126 MIP simplex iterations
3107 branch-and-bound nodes
absmipgap = 0.0600558, relmipgap = 2.40608e-05
7 flow-cover cuts
3 Gomory cuts
2 implied-bound cuts
54 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=3 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.16
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1626
63836 MIP simplex iterations
2047 branch-and-bound nodes
absmipgap = 0.05757, relmipgap = 3.54059e-05
3 flow-cover cuts
1 Gomory cut
38 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=3 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.74
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3073
63033 MIP simplex iterations
2418 branch-and-bound nodes
absmipgap = 0.261622, relmipgap = 8.51358e-05
5 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
86 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=4 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.29
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2219
44140 MIP simplex iterations
1290 branch-and-bound nodes
6 flow-cover cuts
46 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=4 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  8.35
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2707
133637 MIP simplex iterations
4901 branch-and-bound nodes
14 flow-cover cuts
6 Gomory cuts
3 implied-bound cuts
68 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=4 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  5.56
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 3483
68442 MIP simplex iterations
2550 branch-and-bound nodes
2 flow-cover cuts
1 Gomory cut
34 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=4 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  6.89
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1685
77763 MIP simplex iterations
2107 branch-and-bound nodes
14 flow-cover cuts
4 Gomory cuts
1 implied-bound cut
93 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=4 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.7
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2768
67737 MIP simplex iterations
1897 branch-and-bound nodes
12 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
97 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=4 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  5.42
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 3019
94902 MIP simplex iterations
3495 branch-and-bound nodes
16 flow-cover cuts
2 Gomory cuts
3 implied-bound cuts
66 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=4 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.56
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 3280
10575 MIP simplex iterations
505 branch-and-bound nodes
8 flow-cover cuts
3 Gomory cuts
Solving problem with n=10 m=10 scen=4 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.45
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2342
43938 MIP simplex iterations
1445 branch-and-bound nodes
absmipgap = 0.185606, relmipgap = 7.92512e-05
4 flow-cover cuts
3 Gomory cuts
3 implied-bound cuts
56 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=4 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  4.51
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1107
66194 MIP simplex iterations
1204 branch-and-bound nodes
11 flow-cover cuts
4 Gomory cuts
2 implied-bound cuts
75 mixed-integer rounding cuts
Solving problem with n=10 m=10 scen=4 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.53
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 3815
65281 MIP simplex iterations
3032 branch-and-bound nodes
absmipgap = 4.54747e-13, relmipgap = 1.192e-16
4 Gomory cuts
43 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=1 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  0.88
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 904
13481 MIP simplex iterations
531 branch-and-bound nodes
6 Gomory cuts
13 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=1 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.18
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 927
12551 MIP simplex iterations
533 branch-and-bound nodes
2 flow-cover cuts
2 Gomory cuts
19 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=1 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.34
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1078
33743 MIP simplex iterations
2150 branch-and-bound nodes
1 flow-cover cut
3 Gomory cuts
16 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=1 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.12
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 767
28722 MIP simplex iterations
1849 branch-and-bound nodes
1 flow-cover cut
5 Gomory cuts
14 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=1 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.35
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 650
35261 MIP simplex iterations
1878 branch-and-bound nodes
5 Gomory cuts
26 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=1 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.07
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 492
21135 MIP simplex iterations
916 branch-and-bound nodes
absmipgap = 5.79803e-12, relmipgap = 1.17846e-14
5 Gomory cuts
33 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=1 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 409
34565 MIP simplex iterations
1525 branch-and-bound nodes
3 flow-cover cuts
4 Gomory cuts
10 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=1 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.34
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 953
66290 MIP simplex iterations
5100 branch-and-bound nodes
absmipgap = 0.027244, relmipgap = 2.85876e-05
1 flow-cover cut
3 Gomory cuts
21 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=1 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  2.13
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 936
24568 MIP simplex iterations
1239 branch-and-bound nodes
1 Gomory cut
25 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=1 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  1.39
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 703
19431 MIP simplex iterations
1257 branch-and-bound nodes
2 flow-cover cuts
5 Gomory cuts
6 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=2 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  5.24
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 145
79208 MIP simplex iterations
4224 branch-and-bound nodes
7 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=2 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  13.5
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 518
230822 MIP simplex iterations
8427 branch-and-bound nodes
7 flow-cover cuts
1 implied-bound cut
105 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=2 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.73
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 436
21512 MIP simplex iterations
930 branch-and-bound nodes
absmipgap = 2.95586e-12, relmipgap = 6.77949e-15
2 Gomory cuts
19 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=2 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  6.69
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 214
118786 MIP simplex iterations
5125 branch-and-bound nodes
1 flow-cover cut
10 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=2 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  22.6
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 305
480862 MIP simplex iterations
19228 branch-and-bound nodes
11 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=2 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  11.77
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 162
224172 MIP simplex iterations
10837 branch-and-bound nodes
1 clique cut
1 Gomory cut
10 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=2 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  5.57
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 95
95828 MIP simplex iterations
3729 branch-and-bound nodes
1 mixed-integer rounding cut
Solving problem with n=15 m=3 scen=2 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  45.82
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 640
879058 MIP simplex iterations
48099 branch-and-bound nodes
absmipgap = 0.0462764, relmipgap = 7.23069e-05
2 flow-cover cuts
7 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=2 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  7.31
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 546
95262 MIP simplex iterations
2605 branch-and-bound nodes
1 Gomory cut
75 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=2 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  32.68
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 335
616321 MIP simplex iterations
30969 branch-and-bound nodes
absmipgap = 0.0313243, relmipgap = 9.35054e-05
4 flow-cover cuts
2 Gomory cuts
8 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=3 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.32
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1069
50460 MIP simplex iterations
2759 branch-and-bound nodes
absmipgap = 0.0980392, relmipgap = 9.17111e-05
3 Gomory cuts
25 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=3 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.55
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1180
15825 MIP simplex iterations
644 branch-and-bound nodes
absmipgap = 2.27374e-12, relmipgap = 1.9269e-15
3 Gomory cuts
34 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=3 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  11.59
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1469
151320 MIP simplex iterations
10329 branch-and-bound nodes
absmipgap = 0.125696, relmipgap = 8.55656e-05
5 Gomory cuts
28 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=3 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.96
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 941
37307 MIP simplex iterations
2121 branch-and-bound nodes
3 Gomory cuts
27 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=3 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.56
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 1046
76007 MIP simplex iterations
4509 branch-and-bound nodes
1 flow-cover cut
1 Gomory cut
29 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=3 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1.89
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 673
23171 MIP simplex iterations
955 branch-and-bound nodes
absmipgap = 1.47793e-12, relmipgap = 2.19603e-15
2 flow-cover cuts
5 Gomory cuts
33 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=3 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  2.61
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 957
41379 MIP simplex iterations
2156 branch-and-bound nodes
absmipgap = 0.0389757, relmipgap = 4.07269e-05
2 flow-cover cuts
2 Gomory cuts
21 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=3 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.03
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 968
58353 MIP simplex iterations
4204 branch-and-bound nodes
absmipgap = 0.00447559, relmipgap = 4.62354e-06
1 flow-cover cut
2 Gomory cuts
25 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=3 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.82
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 1648
42615 MIP simplex iterations
2007 branch-and-bound nodes
1 flow-cover cut
4 Gomory cuts
31 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=3 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.1
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 862
69030 MIP simplex iterations
4834 branch-and-bound nodes
absmipgap = 0.0565858, relmipgap = 6.56447e-05
2 flow-cover cuts
2 Gomory cuts
14 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=4 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  6.05
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 218
81935 MIP simplex iterations
3504 branch-and-bound nodes
10 flow-cover cuts
4 Gomory cuts
2 implied-bound cuts
33 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=4 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  14.08
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1390
233727 MIP simplex iterations
11525 branch-and-bound nodes
absmipgap = 0.0729106, relmipgap = 5.24537e-05
10 flow-cover cuts
4 Gomory cuts
14 implied-bound cuts
90 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=4 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.95
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 871
73847 MIP simplex iterations
4260 branch-and-bound nodes
1 flow-cover cut
2 Gomory cuts
35 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=4 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  21.81
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 490
416040 MIP simplex iterations
14596 branch-and-bound nodes
absmipgap = 0.01298, relmipgap = 2.64898e-05
6 flow-cover cuts
2 Gomory cuts
4 implied-bound cuts
30 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=4 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  74.86
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 870
1239613 MIP simplex iterations
49758 branch-and-bound nodes
absmipgap = 0.0208897, relmipgap = 2.40112e-05
10 flow-cover cuts
3 Gomory cuts
3 implied-bound cuts
27 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=4 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  11.82
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 569
201313 MIP simplex iterations
6325 branch-and-bound nodes
13 flow-cover cuts
2 Gomory cuts
24 implied-bound cuts
60 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=4 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  40.06
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 743
972879 MIP simplex iterations
37333 branch-and-bound nodes
absmipgap = 0.0301243, relmipgap = 4.05441e-05
25 flow-cover cuts
7 Gomory cuts
15 implied-bound cuts
44 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=4 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  123.57
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1365
2501240 MIP simplex iterations
97931 branch-and-bound nodes
absmipgap = 0.135139, relmipgap = 9.90028e-05
25 flow-cover cuts
4 Gomory cuts
18 implied-bound cuts
54 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=4 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  6.37
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1903
109926 MIP simplex iterations
5881 branch-and-bound nodes
absmipgap = 0.080534, relmipgap = 4.23195e-05
18 flow-cover cuts
2 Gomory cuts
4 implied-bound cuts
53 mixed-integer rounding cuts
Solving problem with n=15 m=3 scen=4 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  79.12
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 654
1373784 MIP simplex iterations
28284 branch-and-bound nodes
absmipgap = 0.0191879, relmipgap = 2.93393e-05
14 flow-cover cuts
5 Gomory cuts
1 implied-bound cut
94 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=1 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  35.27
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 407
492476 MIP simplex iterations
10992 branch-and-bound nodes
20 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=1 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  19.42
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 803
313638 MIP simplex iterations
7902 branch-and-bound nodes
absmipgap = 0.0289911, relmipgap = 3.61035e-05
1 flow-cover cut
3 Gomory cuts
47 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=1 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  116.37
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1290
2271203 MIP simplex iterations
58310 branch-and-bound nodes
absmipgap = 0.126594, relmipgap = 9.81352e-05
3 flow-cover cuts
2 Gomory cuts
53 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=1 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  42.38
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 872
931200 MIP simplex iterations
20151 branch-and-bound nodes
absmipgap = 0.0728147, relmipgap = 8.35031e-05
4 flow-cover cuts
1 Gomory cut
33 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=1 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  3.48
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 986
48521 MIP simplex iterations
1645 branch-and-bound nodes
2 flow-cover cuts
2 Gomory cuts
26 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=1 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  124.99
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1320
2251618 MIP simplex iterations
65315 branch-and-bound nodes
absmipgap = 0.127466, relmipgap = 9.65649e-05
3 flow-cover cuts
1 Gomory cut
60 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=1 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  33.39
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1050
503170 MIP simplex iterations
12672 branch-and-bound nodes
absmipgap = 0.091849, relmipgap = 8.74752e-05
1 flow-cover cut
56 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=1 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  19.18
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 460
276665 MIP simplex iterations
7519 branch-and-bound nodes
absmipgap = 0.0157684, relmipgap = 3.42792e-05
2 Gomory cuts
46 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=1 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  11.52
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 769
157270 MIP simplex iterations
6114 branch-and-bound nodes
1 flow-cover cut
1 Gomory cut
50 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=1 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  23.21
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1113
482902 MIP simplex iterations
18628 branch-and-bound nodes
absmipgap = 0.0807951, relmipgap = 7.25922e-05
3 flow-cover cuts
2 Gomory cuts
17 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=2 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  126.28
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 589
2080830 MIP simplex iterations
31683 branch-and-bound nodes
9 flow-cover cuts
1 Gomory cut
3 implied-bound cuts
80 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=2 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  38.4
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 829
428254 MIP simplex iterations
6667 branch-and-bound nodes
3 flow-cover cuts
1 Gomory cut
67 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=2 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  183.49
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1575
1809118 MIP simplex iterations
46535 branch-and-bound nodes
absmipgap = 0.0199108, relmipgap = 1.26418e-05
7 flow-cover cuts
1 Gomory cut
87 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=2 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  127.77
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 674
2242180 MIP simplex iterations
32293 branch-and-bound nodes
absmipgap = 0.0516129, relmipgap = 7.6577e-05
21 flow-cover cuts
1 Gomory cut
3 implied-bound cuts
90 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=2 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  24.73
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 349
368944 MIP simplex iterations
8628 branch-and-bound nodes
absmipgap = 0.00713824, relmipgap = 2.04534e-05
19 flow-cover cuts
2 implied-bound cuts
32 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=2 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  332.93
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1080
6050180 MIP simplex iterations
110965 branch-and-bound nodes
absmipgap = 0.106619, relmipgap = 9.87217e-05
24 flow-cover cuts
2 implied-bound cuts
110 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=2 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  61.79
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 827
1169089 MIP simplex iterations
27462 branch-and-bound nodes
2 flow-cover cuts
33 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=2 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  159.31
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 492
2832208 MIP simplex iterations
44648 branch-and-bound nodes
8 flow-cover cuts
4 Gomory cuts
2 implied-bound cuts
98 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=2 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  104.5
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 329
2156484 MIP simplex iterations
47561 branch-and-bound nodes
1 flow-cover cut
18 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=2 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  207.89
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 947
3026224 MIP simplex iterations
50545 branch-and-bound nodes
absmipgap = 0.0737757, relmipgap = 7.79047e-05
20 flow-cover cuts
1 Gomory cut
3 implied-bound cuts
96 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=3 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  69.55
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1814
1134594 MIP simplex iterations
36928 branch-and-bound nodes
absmipgap = 0.171513, relmipgap = 9.45494e-05
7 flow-cover cuts
2 Gomory cuts
2 implied-bound cuts
122 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=3 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  17.99
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1965
264505 MIP simplex iterations
6958 branch-and-bound nodes
absmipgap = 0.129807, relmipgap = 6.60597e-05
8 flow-cover cuts
2 Gomory cuts
3 implied-bound cuts
95 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=3 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  136.09
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3168
2386949 MIP simplex iterations
64339 branch-and-bound nodes
absmipgap = 0.315797, relmipgap = 9.96833e-05
2 flow-cover cuts
1 Gomory cut
62 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=3 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  103.16
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 2576
1856631 MIP simplex iterations
54991 branch-and-bound nodes
1 flow-cover cut
3 Gomory cuts
58 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=3 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  14.21
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2000
218441 MIP simplex iterations
7792 branch-and-bound nodes
absmipgap = 0.120025, relmipgap = 6.00126e-05
8 flow-cover cuts
3 Gomory cuts
2 implied-bound cuts
77 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=3 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  268.01
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3157
4112995 MIP simplex iterations
70806 branch-and-bound nodes
absmipgap = 0.291499, relmipgap = 9.23341e-05
8 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
163 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=3 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  24.87
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2554
378022 MIP simplex iterations
10259 branch-and-bound nodes
absmipgap = 0.235834, relmipgap = 9.23391e-05
5 flow-cover cuts
3 Gomory cuts
49 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=3 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  55.9
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1514
947664 MIP simplex iterations
26247 branch-and-bound nodes
absmipgap = 0.116168, relmipgap = 7.67293e-05
1 flow-cover cut
1 Gomory cut
65 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=3 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  32.76
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2025
530709 MIP simplex iterations
17332 branch-and-bound nodes
absmipgap = 0.161014, relmipgap = 7.9513e-05
5 Gomory cuts
41 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=3 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  17.84
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2824
283762 MIP simplex iterations
7032 branch-and-bound nodes
absmipgap = 0.281421, relmipgap = 9.96535e-05
1 flow-cover cut
2 Gomory cuts
46 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=4 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  166.81
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1892
2534731 MIP simplex iterations
49239 branch-and-bound nodes
absmipgap = 0.187029, relmipgap = 9.88527e-05
5 flow-cover cuts
1 Gomory cut
12 implied-bound cuts
181 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=4 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  55.37
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1923
753874 MIP simplex iterations
17976 branch-and-bound nodes
absmipgap = 0.136012, relmipgap = 7.07289e-05
10 flow-cover cuts
2 Gomory cuts
8 implied-bound cuts
95 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=4 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  103.91
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4080
1889252 MIP simplex iterations
68051 branch-and-bound nodes
absmipgap = 0.406096, relmipgap = 9.95334e-05
4 flow-cover cuts
3 Gomory cuts
56 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=4 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  540.68
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2653
10229586 MIP simplex iterations
360148 branch-and-bound nodes
absmipgap = 0.263684, relmipgap = 9.93907e-05
8 flow-cover cuts
3 Gomory cuts
58 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=4 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  54.61
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1865
913110 MIP simplex iterations
28042 branch-and-bound nodes
absmipgap = 0.179762, relmipgap = 9.63869e-05
13 flow-cover cuts
1 implied-bound cut
89 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=4 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  262.3
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3272
4318238 MIP simplex iterations
106473 branch-and-bound nodes
absmipgap = 0.325395, relmipgap = 9.94484e-05
5 flow-cover cuts
97 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=4 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  26.59
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3079
381146 MIP simplex iterations
11459 branch-and-bound nodes
absmipgap = 0.187658, relmipgap = 6.09478e-05
2 flow-cover cuts
3 Gomory cuts
45 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=4 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1733.34
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1865
20159395 MIP simplex iterations
348159 branch-and-bound nodes
absmipgap = 0.178402, relmipgap = 9.5658e-05
25 flow-cover cuts
9 implied-bound cuts
293 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=4 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  31.25
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1386
487098 MIP simplex iterations
17675 branch-and-bound nodes
absmipgap = 0.00802989, relmipgap = 5.79357e-06
3 Gomory cuts
54 mixed-integer rounding cuts
Solving problem with n=15 m=7 scen=4 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  62.45
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3347
964440 MIP simplex iterations
24039 branch-and-bound nodes
absmipgap = 0.333565, relmipgap = 9.96608e-05
8 flow-cover cuts
2 Gomory cuts
2 implied-bound cuts
105 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=1 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  19.55
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 593
233250 MIP simplex iterations
3505 branch-and-bound nodes
2 flow-cover cuts
70 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=1 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  621.22
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2086
9653708 MIP simplex iterations
193250 branch-and-bound nodes
absmipgap = 0.202842, relmipgap = 9.72398e-05
4 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
175 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=1 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  737.45
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2408
13378827 MIP simplex iterations
260780 branch-and-bound nodes
absmipgap = 0.237369, relmipgap = 9.85752e-05
2 flow-cover cuts
1 Gomory cut
67 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=1 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  462.13
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1516
9014175 MIP simplex iterations
186556 branch-and-bound nodes
absmipgap = 0.143569, relmipgap = 9.47027e-05
3 flow-cover cuts
2 Gomory cuts
38 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=1 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  105.19
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1120
1723092 MIP simplex iterations
29491 branch-and-bound nodes
absmipgap = 0.0910288, relmipgap = 8.12757e-05
2 Gomory cuts
49 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=1 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  13.46
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1181
223543 MIP simplex iterations
7140 branch-and-bound nodes
3 flow-cover cuts
2 Gomory cuts
26 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=1 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  81.54
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1266
1478346 MIP simplex iterations
43130 branch-and-bound nodes
absmipgap = 0.123481, relmipgap = 9.75365e-05
1 Gomory cut
39 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=1 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  141.86
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1867
2322547 MIP simplex iterations
44902 branch-and-bound nodes
absmipgap = 0.143677, relmipgap = 7.69561e-05
1 flow-cover cut
2 Gomory cuts
47 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=1 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  410.6
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2184
7385273 MIP simplex iterations
157073 branch-and-bound nodes
absmipgap = 0.21202, relmipgap = 9.70788e-05
2 flow-cover cuts
2 Gomory cuts
55 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=1 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  69.98
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1376
1166455 MIP simplex iterations
22617 branch-and-bound nodes
absmipgap = 0.135676, relmipgap = 9.8602e-05
2 flow-cover cuts
1 Gomory cut
64 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=2 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  134.27
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 801
2172210 MIP simplex iterations
26798 branch-and-bound nodes
absmipgap = 0.0626655, relmipgap = 7.82341e-05
18 flow-cover cuts
6 implied-bound cuts
92 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=2 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  628.38
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1997
7995830 MIP simplex iterations
102397 branch-and-bound nodes
absmipgap = 0.194297, relmipgap = 9.72945e-05
20 flow-cover cuts
2 implied-bound cuts
330 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=2 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  378.93
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2999
5667033 MIP simplex iterations
88148 branch-and-bound nodes
absmipgap = 0.280945, relmipgap = 9.36794e-05
4 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
159 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=2 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  481.5
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2089
8596179 MIP simplex iterations
162875 branch-and-bound nodes
absmipgap = 0.208701, relmipgap = 9.99046e-05
3 flow-cover cuts
3 Gomory cuts
53 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=2 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  297.06
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1153
4050701 MIP simplex iterations
35915 branch-and-bound nodes
absmipgap = 0.0920285, relmipgap = 7.98166e-05
13 flow-cover cuts
3 implied-bound cuts
150 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=2 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  21.03
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 259
305266 MIP simplex iterations
6222 branch-and-bound nodes
12 flow-cover cuts
1 clique cut
2 implied-bound cuts
65 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=2 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  109.98
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 629
1582209 MIP simplex iterations
17793 branch-and-bound nodes
22 flow-cover cuts
2 implied-bound cuts
75 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=2 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  842.98
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2367
13374550 MIP simplex iterations
233718 branch-and-bound nodes
absmipgap = 0.236166, relmipgap = 9.97743e-05
8 flow-cover cuts
1 implied-bound cut
145 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=2 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  43.97
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2796
680102 MIP simplex iterations
23867 branch-and-bound nodes
absmipgap = 0.14521, relmipgap = 5.19349e-05
3 flow-cover cuts
2 Gomory cuts
41 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=2 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  95.04
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1979
1418979 MIP simplex iterations
64894 branch-and-bound nodes
absmipgap = 0.166018, relmipgap = 8.38898e-05
8 flow-cover cuts
3 Gomory cuts
47 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=3 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  99.28
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2561
1278423 MIP simplex iterations
22889 branch-and-bound nodes
absmipgap = 0.207373, relmipgap = 8.09733e-05
6 flow-cover cuts
1 Gomory cut
1 implied-bound cut
188 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=3 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  421.98
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4058
6402916 MIP simplex iterations
112918 branch-and-bound nodes
absmipgap = 0.404053, relmipgap = 9.95695e-05
7 flow-cover cuts
2 Gomory cuts
3 implied-bound cuts
139 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=3 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  863.46
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4564
13280470 MIP simplex iterations
216096 branch-and-bound nodes
absmipgap = 0.437273, relmipgap = 9.58091e-05
10 flow-cover cuts
3 Gomory cuts
3 implied-bound cuts
151 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=3 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  270.8
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3866
4927377 MIP simplex iterations
127928 branch-and-bound nodes
absmipgap = 0.378724, relmipgap = 9.79627e-05
4 flow-cover cuts
2 Gomory cuts
54 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=3 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  115.21
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3323
1493353 MIP simplex iterations
25049 branch-and-bound nodes
absmipgap = 0.302105, relmipgap = 9.09132e-05
11 flow-cover cuts
1 Gomory cut
1 implied-bound cut
135 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=3 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  157.19
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2774
2592403 MIP simplex iterations
63487 branch-and-bound nodes
absmipgap = 0.259918, relmipgap = 9.36978e-05
4 flow-cover cuts
2 Gomory cuts
42 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=3 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  200.3
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3196
2789892 MIP simplex iterations
51375 branch-and-bound nodes
absmipgap = 0.267526, relmipgap = 8.37065e-05
9 flow-cover cuts
1 Gomory cut
2 implied-bound cuts
196 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=3 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  275.55
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4624
4780511 MIP simplex iterations
105025 branch-and-bound nodes
absmipgap = 0.447208, relmipgap = 9.67146e-05
2 flow-cover cuts
2 Gomory cuts
66 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=3 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  328.09
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4400
5262305 MIP simplex iterations
155579 branch-and-bound nodes
absmipgap = 0.425289, relmipgap = 9.66566e-05
11 flow-cover cuts
2 Gomory cuts
5 implied-bound cuts
113 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=3 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  54.03
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3969
850239 MIP simplex iterations
29104 branch-and-bound nodes
absmipgap = 0.372605, relmipgap = 9.38788e-05
2 flow-cover cuts
3 Gomory cuts
45 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=4 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  1086.18
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2531
17112817 MIP simplex iterations
156080 branch-and-bound nodes
absmipgap = 0.252075, relmipgap = 9.9595e-05
43 flow-cover cuts
17 implied-bound cuts
163 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=4 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  546.82
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4101
8769846 MIP simplex iterations
176718 branch-and-bound nodes
absmipgap = 0.40353, relmipgap = 9.8398e-05
11 flow-cover cuts
1 Gomory cut
4 implied-bound cuts
124 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=4 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  577.3
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5327
8965518 MIP simplex iterations
145475 branch-and-bound nodes
absmipgap = 0.465899, relmipgap = 8.74599e-05
8 flow-cover cuts
1 Gomory cut
4 implied-bound cuts
154 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=4 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  234.54
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4891
4139006 MIP simplex iterations
100830 branch-and-bound nodes
absmipgap = 0.481366, relmipgap = 9.84187e-05
5 flow-cover cuts
1 Gomory cut
65 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=4 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  474.96
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2953
7007364 MIP simplex iterations
127066 branch-and-bound nodes
absmipgap = 0.287819, relmipgap = 9.74665e-05
6 flow-cover cuts
4 implied-bound cuts
149 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=4 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  200.1
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2073
2979301 MIP simplex iterations
65516 branch-and-bound nodes
absmipgap = 0.207051, relmipgap = 9.98799e-05
3 flow-cover cuts
2 Gomory cuts
1 implied-bound cut
122 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=4 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  76.38
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2293
918073 MIP simplex iterations
17861 branch-and-bound nodes
absmipgap = 0.190439, relmipgap = 8.30525e-05
5 flow-cover cuts
2 Gomory cuts
3 implied-bound cuts
121 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=4 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  272.66
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5462
4595026 MIP simplex iterations
100085 branch-and-bound nodes
absmipgap = 0.539819, relmipgap = 9.88318e-05
2 flow-cover cuts
2 Gomory cuts
69 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=4 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  118.37
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5746
2026289 MIP simplex iterations
86389 branch-and-bound nodes
absmipgap = 0.574592, relmipgap = 9.99986e-05
4 flow-cover cuts
1 Gomory cut
39 mixed-integer rounding cuts
Solving problem with n=15 m=10 scen=4 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  38.26
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5382
580023 MIP simplex iterations
21190 branch-and-bound nodes
absmipgap = 0.524546, relmipgap = 9.74631e-05
5 flow-cover cuts
4 Gomory cuts
47 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=1 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  1.77
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1758
22189 MIP simplex iterations
985 branch-and-bound nodes
absmipgap = 0.0271006, relmipgap = 1.54156e-05
3 Gomory cuts
12 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=1 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  6.57
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1611
110050 MIP simplex iterations
3982 branch-and-bound nodes
2 Gomory cuts
40 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=1 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  9.37
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1077
204614 MIP simplex iterations
12257 branch-and-bound nodes
absmipgap = 0.0661897, relmipgap = 6.14575e-05
2 flow-cover cuts
1 Gomory cut
9 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=1 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  35.56
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 678
509412 MIP simplex iterations
38225 branch-and-bound nodes
absmipgap = 0.0496237, relmipgap = 7.31914e-05
4 Gomory cuts
10 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=1 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  3.9
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1306
59534 MIP simplex iterations
2608 branch-and-bound nodes
4 flow-cover cuts
3 Gomory cuts
14 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=1 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  2.51
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1325
28092 MIP simplex iterations
1412 branch-and-bound nodes
2 flow-cover cuts
5 Gomory cuts
14 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=1 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  252.83
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 811
1853428 MIP simplex iterations
121101 branch-and-bound nodes
absmipgap = 0.0714286, relmipgap = 8.80747e-05
4 Gomory cuts
8 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=1 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  4.34
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2395
58653 MIP simplex iterations
3987 branch-and-bound nodes
1 flow-cover cut
2 Gomory cuts
13 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=1 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.75
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 1696
29238 MIP simplex iterations
1038 branch-and-bound nodes
4 Gomory cuts
19 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=1 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  2.69
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2229
28971 MIP simplex iterations
1664 branch-and-bound nodes
3 Gomory cuts
18 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=2 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  411.86
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 685
7589206 MIP simplex iterations
294807 branch-and-bound nodes
absmipgap = 0.0481485, relmipgap = 7.02898e-05
2 flow-cover cuts
8 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=2 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.02
Solve =  241.12
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1014
4277637 MIP simplex iterations
163577 branch-and-bound nodes
absmipgap = 0.0901728, relmipgap = 8.89278e-05
2 flow-cover cuts
2 Gomory cuts
68 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=2 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  280.27
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 295
5104946 MIP simplex iterations
194607 branch-and-bound nodes
absmipgap = 0.028397, relmipgap = 9.6261e-05
1 flow-cover cut
Solving problem with n=20 m=3 scen=2 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  93.56
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 226
2091941 MIP simplex iterations
59043 branch-and-bound nodes
absmipgap = 0.00138241, relmipgap = 6.11686e-06
6 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=2 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  459.08
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 449
7105384 MIP simplex iterations
312671 branch-and-bound nodes
absmipgap = 0.030486, relmipgap = 6.78974e-05
6 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=2 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  207.82
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 629
3546132 MIP simplex iterations
144837 branch-and-bound nodes
2 Gomory cuts
6 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=2 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  649.45
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 540
11768425 MIP simplex iterations
362997 branch-and-bound nodes
absmipgap = 0.0507073, relmipgap = 9.39024e-05
1 flow-cover cut
13 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=2 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  7.13
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 848
115394 MIP simplex iterations
6244 branch-and-bound nodes
absmipgap = 0.0495575, relmipgap = 5.84405e-05
2 flow-cover cuts
4 Gomory cuts
19 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=2 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  29.18
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 444
394406 MIP simplex iterations
22756 branch-and-bound nodes
absmipgap = 0.0415553, relmipgap = 9.35929e-05
Solving problem with n=20 m=3 scen=2 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  60.5
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 999
1454284 MIP simplex iterations
56927 branch-and-bound nodes
absmipgap = 0.0639003, relmipgap = 6.39642e-05
2 flow-cover cuts
5 Gomory cuts
21 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=3 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  43.9
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2507
463057 MIP simplex iterations
25398 branch-and-bound nodes
absmipgap = 0.233901, relmipgap = 9.32991e-05
5 Gomory cuts
34 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=3 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  65.58
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2423
786950 MIP simplex iterations
35849 branch-and-bound nodes
absmipgap = 0.233944, relmipgap = 9.65513e-05
4 Gomory cuts
42 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=3 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  54.82
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1437
486516 MIP simplex iterations
22741 branch-and-bound nodes
absmipgap = 0.11359, relmipgap = 7.90465e-05
4 Gomory cuts
38 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=3 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  24.88
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1909
456399 MIP simplex iterations
22409 branch-and-bound nodes
absmipgap = 0.188134, relmipgap = 9.85509e-05
2 Gomory cuts
33 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=3 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  82.83
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1648
657361 MIP simplex iterations
34252 branch-and-bound nodes
absmipgap = 0.154551, relmipgap = 9.37811e-05
4 Gomory cuts
20 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=3 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  4.49
Output = 0.01
CPLEX 12.1.0: optimal integer solution; objective 1510
58752 MIP simplex iterations
2313 branch-and-bound nodes
3 Gomory cuts
20 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=3 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  59.91
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1868
1376908 MIP simplex iterations
64610 branch-and-bound nodes
absmipgap = 0.177746, relmipgap = 9.5153e-05
3 Gomory cuts
29 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=3 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  4.05
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2529
69181 MIP simplex iterations
3594 branch-and-bound nodes
1 flow-cover cut
8 Gomory cuts
14 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=3 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  5.5
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 2037
60306 MIP simplex iterations
2132 branch-and-bound nodes
4 Gomory cuts
35 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=3 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  7.77
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2528
103911 MIP simplex iterations
6501 branch-and-bound nodes
absmipgap = 0.21112, relmipgap = 8.35128e-05
3 flow-cover cuts
7 Gomory cuts
16 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=4 seed=1
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  1017.26
Output = 0.02
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2685
14862096 MIP simplex iterations
863629 branch-and-bound nodes
absmipgap = 0.268115, relmipgap = 9.98564e-05
2 flow-cover cuts
8 Gomory cuts
41 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=4 seed=2
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  116.9
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2601
1902810 MIP simplex iterations
98747 branch-and-bound nodes
absmipgap = 0.259613, relmipgap = 9.98128e-05
5 flow-cover cuts
4 Gomory cuts
58 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=4 seed=3
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  877.2
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 880
15229712 MIP simplex iterations
292699 branch-and-bound nodes
absmipgap = 0.0816397, relmipgap = 9.27724e-05
12 flow-cover cuts
4 Gomory cuts
10 implied-bound cuts
88 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=4 seed=4
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  158.94
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1819
2337868 MIP simplex iterations
158186 branch-and-bound nodes
absmipgap = 0.179529, relmipgap = 9.86966e-05
19 flow-cover cuts
10 Gomory cuts
2 implied-bound cuts
55 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=4 seed=5
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  147.21
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 628
2212486 MIP simplex iterations
60424 branch-and-bound nodes
absmipgap = 0.0023846, relmipgap = 3.79713e-06
7 flow-cover cuts
1 Gomory cut
9 implied-bound cuts
37 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=4 seed=6
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  30.85
Output = 0
CPLEX 12.1.0: optimal integer solution; objective 679
444258 MIP simplex iterations
16485 branch-and-bound nodes
1 flow-cover cut
1 Gomory cut
11 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=4 seed=7
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  49.2
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1961
677980 MIP simplex iterations
39454 branch-and-bound nodes
absmipgap = 0.153162, relmipgap = 7.81042e-05
14 flow-cover cuts
7 Gomory cuts
20 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=4 seed=8
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0.01
Solve =  50.67
Output = 0.01
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2257
911489 MIP simplex iterations
67207 branch-and-bound nodes
absmipgap = 0.187572, relmipgap = 8.31068e-05
1 flow-cover cut
10 Gomory cuts
17 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=4 seed=9
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  89.14
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 980
1760895 MIP simplex iterations
51905 branch-and-bound nodes
absmipgap = 0.0760672, relmipgap = 7.76196e-05
2 flow-cover cuts
1 Gomory cut
48 mixed-integer rounding cuts
Solving problem with n=20 m=3 scen=4 seed=10
CPLEX 12.1.0: timing=1

Times (seconds):
Input =  0
Solve =  57.82
Output = 0
CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2592
829011 MIP simplex iterations
31218 branch-and-bound nodes
absmipgap = 0.227025, relmipgap = 8.75867e-05
16 flow-cover cuts
6 Gomory cuts
8 implied-bound cuts
72 mixed-integer rounding cuts