===================== USING MODEL: mub4 ===================== Solving problem with n=5 m=3 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.11 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 117 219 MIP simplex iterations 23 branch-and-bound nodes 10 flow-cover cuts 5 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 213 887 MIP simplex iterations 85 branch-and-bound nodes 1 cover cut 20 flow-cover cuts 3 Gomory cuts 4 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 102 282 MIP simplex iterations 8 branch-and-bound nodes 9 flow-cover cuts 3 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 169 559 MIP simplex iterations 68 branch-and-bound nodes 16 flow-cover cuts 2 Gomory cuts 4 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 165 503 MIP simplex iterations 49 branch-and-bound nodes 19 flow-cover cuts 2 Gomory cuts 6 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 111 233 MIP simplex iterations 16 branch-and-bound nodes 12 flow-cover cuts 4 Gomory cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 117 212 MIP simplex iterations 23 branch-and-bound nodes 10 flow-cover cuts 5 Gomory cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.11 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 290 866 MIP simplex iterations 68 branch-and-bound nodes 8 flow-cover cuts 5 Gomory cuts Solving problem with n=5 m=3 scen=1 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 61 193 MIP simplex iterations 8 branch-and-bound nodes 13 flow-cover cuts 1 Gomory cut Solving problem with n=5 m=3 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 100 238 MIP simplex iterations 15 branch-and-bound nodes 10 flow-cover cuts 1 Gomory cut Solving problem with n=5 m=3 scen=2 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 43 37 MIP simplex iterations 0 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=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 165 179 MIP simplex iterations 19 branch-and-bound nodes 4 flow-cover cuts 3 Gomory cuts Solving problem with n=5 m=3 scen=2 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 71 58 MIP simplex iterations 0 branch-and-bound nodes 5 flow-cover cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=2 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 102 71 MIP simplex iterations 0 branch-and-bound nodes 11 flow-cover cuts 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 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 196 381 MIP simplex iterations 33 branch-and-bound nodes 1 cover cut 12 flow-cover cuts 3 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 107 99 MIP simplex iterations 5 branch-and-bound nodes 7 flow-cover cuts 3 Gomory cuts 4 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 153 53 MIP simplex iterations 0 branch-and-bound nodes 3 flow-cover cuts 4 Gomory cuts 1 implied-bound cut 1 zero-half cut Solving problem with n=5 m=3 scen=2 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 251 152 MIP simplex iterations 12 branch-and-bound nodes 1 cover cut 9 flow-cover cuts 5 Gomory cuts Solving problem with n=5 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 62 66 MIP simplex iterations 0 branch-and-bound nodes 7 flow-cover 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 61 MIP simplex iterations 0 branch-and-bound nodes 3 flow-cover cuts 1 zero-half cut Solving problem with n=5 m=3 scen=3 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 210 466 MIP simplex iterations 34 branch-and-bound nodes 2 cover cuts 12 flow-cover cuts 4 Gomory cuts 7 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.07 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 318 365 MIP simplex iterations 52 branch-and-bound nodes 13 flow-cover cuts 1 Gomory cut 8 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 250 667 MIP simplex iterations 53 branch-and-bound nodes 23 flow-cover cuts 7 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.21 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 393 710 MIP simplex iterations 104 branch-and-bound nodes 17 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.13 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 212 421 MIP simplex iterations 49 branch-and-bound nodes 13 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 268 455 MIP simplex iterations 72 branch-and-bound nodes 2 cover cuts 21 flow-cover cuts 4 Gomory cuts 7 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 383 603 MIP simplex iterations 84 branch-and-bound nodes 3 cover cuts 16 flow-cover cuts 3 Gomory cuts 6 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.24 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 447 1053 MIP simplex iterations 111 branch-and-bound nodes 3 cover cuts 22 flow-cover cuts 5 Gomory cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.19 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 230 799 MIP simplex iterations 79 branch-and-bound nodes 2 cover cuts 25 flow-cover cuts 3 Gomory cuts 6 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.19 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 280 637 MIP simplex iterations 75 branch-and-bound nodes 2 cover cuts 15 flow-cover cuts 6 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 108 51 MIP simplex iterations 0 branch-and-bound nodes 8 flow-cover cuts 3 Gomory cuts Solving problem with n=5 m=3 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.01 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 269 248 MIP simplex iterations 36 branch-and-bound nodes 7 flow-cover cuts 3 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=4 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 199 154 MIP simplex iterations 10 branch-and-bound nodes 8 flow-cover cuts 4 Gomory cuts 1 implied-bound cut 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 301 MIP simplex iterations 35 branch-and-bound nodes 11 flow-cover cuts 3 Gomory cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.18 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 277 387 MIP simplex iterations 40 branch-and-bound nodes 1 cover cut 12 flow-cover cuts 3 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 408 212 MIP simplex iterations 27 branch-and-bound nodes 5 flow-cover cuts 4 Gomory cuts 7 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.24 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 471 216 MIP simplex iterations 40 branch-and-bound nodes 5 flow-cover cuts 5 Gomory cuts 4 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 668 MIP simplex iterations 68 branch-and-bound nodes 9 flow-cover cuts 5 Gomory cuts Solving problem with n=5 m=3 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 129 65 MIP simplex iterations 0 branch-and-bound nodes 5 flow-cover cuts Solving problem with n=5 m=3 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 249 120 MIP simplex iterations 8 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 = 2.59 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 371 40562 MIP simplex iterations 2813 branch-and-bound nodes absmipgap = 5.11591e-13, relmipgap = 1.37895e-15 97 flow-cover cuts 29 Gomory cuts 54 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 10.82 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 396 158262 MIP simplex iterations 10240 branch-and-bound nodes 72 flow-cover cuts 21 Gomory cuts 114 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.74 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 391 11071 MIP simplex iterations 832 branch-and-bound nodes 61 flow-cover cuts 5 Gomory cuts 29 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.64 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 388 26900 MIP simplex iterations 2053 branch-and-bound nodes 2 cover cuts 77 flow-cover cuts 11 Gomory cuts 42 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.42 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 496 20705 MIP simplex iterations 1302 branch-and-bound nodes 103 flow-cover cuts 14 Gomory cuts 51 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.43 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 358 32732 MIP simplex iterations 2309 branch-and-bound nodes absmipgap = 0.0138889, relmipgap = 3.87958e-05 86 flow-cover cuts 8 Gomory cuts 66 implied-bound cuts 2 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.21 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 358 27754 MIP simplex iterations 2654 branch-and-bound nodes 47 flow-cover cuts 9 Gomory cuts 49 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 7.67 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 809 125534 MIP simplex iterations 12260 branch-and-bound nodes 4 cover cuts 77 flow-cover cuts 17 Gomory cuts 75 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 2.64 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 336 51422 MIP simplex iterations 2172 branch-and-bound nodes 130 flow-cover cuts 15 Gomory cuts 59 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 252 1563 MIP simplex iterations 116 branch-and-bound nodes 47 flow-cover cuts 8 Gomory cuts 21 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 147 558 MIP simplex iterations 30 branch-and-bound nodes 32 flow-cover cuts 16 Gomory cuts 3 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.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 200 1652 MIP simplex iterations 146 branch-and-bound nodes 39 flow-cover cuts 4 Gomory cuts 10 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.04 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 421 541 MIP simplex iterations 62 branch-and-bound nodes 25 flow-cover cuts 12 Gomory cuts 15 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.04 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 211 522 MIP simplex iterations 30 branch-and-bound nodes 27 flow-cover cuts 8 Gomory cuts 5 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.65 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 546 8400 MIP simplex iterations 752 branch-and-bound nodes 1 cover cut 64 flow-cover cuts 14 Gomory cuts 52 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=10 m=3 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.3 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 247 3837 MIP simplex iterations 488 branch-and-bound nodes 1 cover cut 58 flow-cover cuts 8 Gomory cuts 38 implied-bound cuts Solving problem with n=10 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 106 219 MIP simplex iterations 0 branch-and-bound nodes 12 flow-cover cuts 3 Gomory cuts 6 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.15 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 381 2846 MIP simplex iterations 279 branch-and-bound nodes 73 flow-cover cuts 11 Gomory cuts 20 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.08 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 205 1724 MIP simplex iterations 165 branch-and-bound nodes 39 flow-cover cuts 9 Gomory cuts Solving problem with n=10 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.04 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 117 486 MIP simplex iterations 30 branch-and-bound nodes 19 flow-cover cuts 16 Gomory cuts 6 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 50.71 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 722 690909 MIP simplex iterations 71361 branch-and-bound nodes absmipgap = 0.00214621, relmipgap = 2.97259e-06 117 flow-cover cuts 20 Gomory cuts 148 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 30.37 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 565 519878 MIP simplex iterations 48613 branch-and-bound nodes absmipgap = 0.0224881, relmipgap = 3.98019e-05 105 flow-cover cuts 22 Gomory cuts 174 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.95 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 865 71265 MIP simplex iterations 9118 branch-and-bound nodes 1 cover cut 77 flow-cover cuts 6 Gomory cuts 115 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 6.19 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 553 136250 MIP simplex iterations 8718 branch-and-bound nodes 1 cover cut 120 flow-cover cuts 24 Gomory cuts 106 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 12.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 873 246445 MIP simplex iterations 23087 branch-and-bound nodes 119 flow-cover cuts 16 Gomory cuts 180 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 26.93 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 497 611368 MIP simplex iterations 44145 branch-and-bound nodes absmipgap = 4.7984e-07, relmipgap = 9.65474e-10 1 cover cut 118 flow-cover cuts 28 Gomory cuts 142 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 11.74 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 623 198368 MIP simplex iterations 21906 branch-and-bound nodes absmipgap = 7.79885e-06, relmipgap = 1.25182e-08 1 cover cut 77 flow-cover cuts 13 Gomory cuts 133 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 6.64 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 809 145647 MIP simplex iterations 12609 branch-and-bound nodes absmipgap = 0.0208502, relmipgap = 2.57728e-05 5 cover cuts 102 flow-cover cuts 15 Gomory cuts 107 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.32 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 424 151957 MIP simplex iterations 9212 branch-and-bound nodes 112 flow-cover cuts 8 Gomory cuts 124 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.24 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 463 42675 MIP simplex iterations 4041 branch-and-bound nodes 103 flow-cover cuts 29 Gomory cuts 76 implied-bound cuts Solving problem with n=10 m=3 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.94 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 720 45767 MIP simplex iterations 5915 branch-and-bound nodes 51 flow-cover cuts 18 Gomory cuts 75 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=10 m=3 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.41 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 299 16738 MIP simplex iterations 1403 branch-and-bound nodes absmipgap = 1.43814e-11, relmipgap = 4.80983e-14 41 flow-cover cuts 8 Gomory cuts 34 implied-bound cuts Solving problem with n=10 m=3 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.54 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1036 7017 MIP simplex iterations 1062 branch-and-bound nodes 30 flow-cover cuts 6 Gomory cuts 75 implied-bound cuts Solving problem with n=10 m=3 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 496 1370 MIP simplex iterations 126 branch-and-bound nodes 36 flow-cover cuts 12 Gomory cuts 12 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.26 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1285 8414 MIP simplex iterations 1212 branch-and-bound nodes 1 cover cut 40 flow-cover cuts 14 Gomory cuts 60 implied-bound cuts Solving problem with n=10 m=3 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.5 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 249 6037 MIP simplex iterations 586 branch-and-bound nodes 1 cover cut 38 flow-cover cuts 6 Gomory cuts 12 implied-bound cuts Solving problem with n=10 m=3 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.43 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 424 2381 MIP simplex iterations 416 branch-and-bound nodes 21 flow-cover cuts 17 Gomory cuts 35 implied-bound cuts Solving problem with n=10 m=3 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.12 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 394 2009 MIP simplex iterations 226 branch-and-bound nodes 47 flow-cover cuts 14 Gomory cuts 17 implied-bound cuts Solving problem with n=10 m=3 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 202 1970 MIP simplex iterations 188 branch-and-bound nodes 42 flow-cover cuts 7 Gomory cuts 17 implied-bound cuts Solving problem with n=10 m=3 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 427 559 MIP simplex iterations 57 branch-and-bound nodes 25 flow-cover cuts 7 Gomory cuts 12 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 16.17 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 659 243554 MIP simplex iterations 13197 branch-and-bound nodes absmipgap = 0.00926381, relmipgap = 1.40574e-05 145 flow-cover cuts 13 Gomory cuts 297 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 11.35 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 786 129631 MIP simplex iterations 14173 branch-and-bound nodes 1 cover cut 52 flow-cover cuts 8 Gomory cuts 242 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 10.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 685 151373 MIP simplex iterations 11116 branch-and-bound nodes 79 flow-cover cuts 2 Gomory cuts 322 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 129.65 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1241 1802142 MIP simplex iterations 147129 branch-and-bound nodes absmipgap = 0.052441, relmipgap = 4.2257e-05 88 flow-cover cuts 1 Gomory cut 444 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 42.42 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 930 600683 MIP simplex iterations 39451 branch-and-bound nodes absmipgap = 0.0369146, relmipgap = 3.96931e-05 1 cover cut 137 flow-cover cuts 1 Gomory cut 382 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.78 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 238 8807 MIP simplex iterations 406 branch-and-bound nodes 69 flow-cover cuts 3 Gomory cuts 61 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 63.96 Output = 0 CPLEX 12.1.0: optimal (non-)integer solution; objective 1476.43996 927843 MIP simplex iterations 59459 branch-and-bound nodes 1 integer variables rounded (maxerr = 5.48574e-07). Assigning integrality = 3e-07 might help. Currently integrality = 1e-05. 2 cover cuts 131 flow-cover cuts 11 Gomory cuts 386 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 296 43760 MIP simplex iterations 2073 branch-and-bound nodes absmipgap = 6.59713e-09, relmipgap = 2.22876e-11 72 flow-cover cuts 152 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 10.75 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 734 152494 MIP simplex iterations 13565 branch-and-bound nodes 95 flow-cover cuts 5 Gomory cuts 253 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 49.11 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 985 646609 MIP simplex iterations 47833 branch-and-bound nodes 1 cover cut 121 flow-cover cuts 10 Gomory cuts 396 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.01 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1001 13971 MIP simplex iterations 1095 branch-and-bound nodes absmipgap = 4.77456e-07, relmipgap = 4.76979e-10 1 cover cut 71 flow-cover cuts 15 Gomory cuts 187 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.24 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1163 23658 MIP simplex iterations 2066 branch-and-bound nodes 1 cover cut 44 flow-cover cuts 5 Gomory cuts 194 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.27 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 919 11472 MIP simplex iterations 967 branch-and-bound nodes 2 cover cuts 35 flow-cover cuts 8 Gomory cuts 82 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 41.55 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1574 390780 MIP simplex iterations 35937 branch-and-bound nodes 1 cover cut 96 flow-cover cuts 5 Gomory cuts 396 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 4.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 987 42721 MIP simplex iterations 4272 branch-and-bound nodes 70 flow-cover cuts 15 Gomory cuts 220 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 144 913 MIP simplex iterations 48 branch-and-bound nodes 31 flow-cover cuts 4 Gomory cuts 11 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 12.63 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2021 192818 MIP simplex iterations 13579 branch-and-bound nodes absmipgap = 0.0804598, relmipgap = 3.98119e-05 3 cover cuts 104 flow-cover cuts 1 Gomory cut 376 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.13 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 212 568 MIP simplex iterations 9 branch-and-bound nodes 27 flow-cover cuts 9 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.57 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 701 8153 MIP simplex iterations 647 branch-and-bound nodes 1 cover cut 40 flow-cover cuts 4 Gomory cuts 111 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 6.44 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1309 79410 MIP simplex iterations 6295 branch-and-bound nodes 1 cover cut 87 flow-cover cuts 26 Gomory cuts 351 implied-bound cuts Solving problem with n=10 m=7 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 152.58 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1805 1923291 MIP simplex iterations 163317 branch-and-bound nodes absmipgap = 0.135135, relmipgap = 7.48671e-05 2 cover cuts 158 flow-cover cuts 21 Gomory cuts 452 implied-bound cuts Solving problem with n=10 m=7 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 41.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1748 476474 MIP simplex iterations 54937 branch-and-bound nodes 4 cover cuts 76 flow-cover cuts 10 Gomory cuts 341 implied-bound cuts Solving problem with n=10 m=7 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 142.19 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1936 1619460 MIP simplex iterations 181702 branch-and-bound nodes absmipgap = 4.40903e-07, relmipgap = 2.27739e-10 15 cover cuts 110 flow-cover cuts 22 Gomory cuts 438 implied-bound cuts Solving problem with n=10 m=7 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 90.69 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2468 849448 MIP simplex iterations 123948 branch-and-bound nodes 10 cover cuts 53 flow-cover cuts 390 implied-bound cuts Solving problem with n=10 m=7 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 86.6 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1940 976750 MIP simplex iterations 115534 branch-and-bound nodes absmipgap = 0.0909091, relmipgap = 4.68604e-05 7 cover cuts 76 flow-cover cuts 8 Gomory cuts 397 implied-bound cuts Solving problem with n=10 m=7 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 108.75 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 892 1497992 MIP simplex iterations 104156 branch-and-bound nodes absmipgap = 0.0615385, relmipgap = 6.89893e-05 1 cover cut 120 flow-cover cuts 8 Gomory cuts 433 implied-bound cuts Solving problem with n=10 m=7 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 45.29 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2370 516806 MIP simplex iterations 54826 branch-and-bound nodes absmipgap = 0.0147059, relmipgap = 6.20501e-06 11 cover cuts 71 flow-cover cuts 1 Gomory cut 340 implied-bound cuts Solving problem with n=10 m=7 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 111.26 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1193 1430203 MIP simplex iterations 122800 branch-and-bound nodes absmipgap = 2.43737e-07, relmipgap = 2.04306e-10 2 cover cuts 137 flow-cover cuts 4 Gomory cuts 400 implied-bound cuts Solving problem with n=10 m=7 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 99.41 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1734 1151370 MIP simplex iterations 112423 branch-and-bound nodes 10 cover cuts 118 flow-cover cuts 18 Gomory cuts 409 implied-bound cuts Solving problem with n=10 m=7 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 139.75 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2197 1590433 MIP simplex iterations 175090 branch-and-bound nodes 10 cover cuts 111 flow-cover cuts 16 Gomory cuts 460 implied-bound cuts Solving problem with n=10 m=7 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 12.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2270 120124 MIP simplex iterations 12758 branch-and-bound nodes 52 flow-cover cuts 8 Gomory cuts 292 implied-bound cuts Solving problem with n=10 m=7 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 7.21 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2245 75090 MIP simplex iterations 8974 branch-and-bound nodes absmipgap = 3.64016e-07, relmipgap = 1.62145e-10 4 cover cuts 68 flow-cover cuts 3 Gomory cuts 177 implied-bound cuts Solving problem with n=10 m=7 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 15.13 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2152 178529 MIP simplex iterations 17329 branch-and-bound nodes absmipgap = 0.00293826, relmipgap = 1.36536e-06 9 cover cuts 100 flow-cover cuts 28 Gomory cuts 325 implied-bound cuts Solving problem with n=10 m=7 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 133.64 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3096 1189204 MIP simplex iterations 168580 branch-and-bound nodes absmipgap = 0.109437, relmipgap = 3.5348e-05 12 cover cuts 61 flow-cover cuts 9 Gomory cuts 421 implied-bound cuts Solving problem with n=10 m=7 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 23.23 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2141 261521 MIP simplex iterations 26246 branch-and-bound nodes absmipgap = 0.182887, relmipgap = 8.54215e-05 1 cover cut 106 flow-cover cuts 18 Gomory cuts 345 implied-bound cuts Solving problem with n=10 m=7 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.11 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 234 1357 MIP simplex iterations 85 branch-and-bound nodes 35 flow-cover cuts 5 Gomory cuts 18 implied-bound cuts Solving problem with n=10 m=7 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 53.39 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3194 594353 MIP simplex iterations 59396 branch-and-bound nodes absmipgap = 0.289646, relmipgap = 9.06846e-05 5 cover cuts 76 flow-cover cuts 347 implied-bound cuts Solving problem with n=10 m=7 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 5.53 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1183 47692 MIP simplex iterations 5090 branch-and-bound nodes 66 flow-cover cuts 5 Gomory cuts 241 implied-bound cuts Solving problem with n=10 m=7 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.59 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1667 37687 MIP simplex iterations 3762 branch-and-bound nodes 2 cover cuts 56 flow-cover cuts 4 Gomory cuts 232 implied-bound cuts Solving problem with n=10 m=7 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 36.01 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 2845 331263 MIP simplex iterations 51336 branch-and-bound nodes 6 cover cuts 42 flow-cover cuts 8 Gomory cuts 322 implied-bound cuts Solving problem with n=10 m=10 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 3.35 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 707 25318 MIP simplex iterations 1763 branch-and-bound nodes 94 flow-cover cuts 11 Gomory cuts 247 implied-bound cuts Solving problem with n=10 m=10 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 345.17 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1643 3835579 MIP simplex iterations 293403 branch-and-bound nodes absmipgap = 0.091954, relmipgap = 5.59671e-05 2 cover cuts 117 flow-cover cuts 559 implied-bound cuts Solving problem with n=10 m=10 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 10.46 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1200 102317 MIP simplex iterations 8151 branch-and-bound nodes 76 flow-cover cuts 1 Gomory cut 349 implied-bound cuts Solving problem with n=10 m=10 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 10.63 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 681 123261 MIP simplex iterations 7697 branch-and-bound nodes 62 flow-cover cuts 1 Gomory cut 404 implied-bound cuts Solving problem with n=10 m=10 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 143.68 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1529 1915969 MIP simplex iterations 103230 branch-and-bound nodes absmipgap = 0.0879121, relmipgap = 5.74965e-05 8 cover cuts 177 flow-cover cuts 497 implied-bound cuts Solving problem with n=10 m=10 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 23.26 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1162 220238 MIP simplex iterations 20526 branch-and-bound nodes absmipgap = 3.12692e-07, relmipgap = 2.69098e-10 82 flow-cover cuts 1 Gomory cut 385 implied-bound cuts Solving problem with n=10 m=10 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 52.22 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1609 598074 MIP simplex iterations 36556 branch-and-bound nodes absmipgap = 0.010989, relmipgap = 6.82971e-06 1 cover cut 111 flow-cover cuts 20 Gomory cuts 561 implied-bound cuts Solving problem with n=10 m=10 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 24.27 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 912 350142 MIP simplex iterations 13998 branch-and-bound nodes absmipgap = 0.0289855, relmipgap = 3.17824e-05 117 flow-cover cuts 22 Gomory cuts 435 implied-bound cuts Solving problem with n=10 m=10 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 47.08 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 908 558425 MIP simplex iterations 31928 branch-and-bound nodes absmipgap = 0.0362516, relmipgap = 3.99246e-05 1 cover cut 87 flow-cover cuts 570 implied-bound cuts Solving problem with n=10 m=10 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 358.9 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1621 3716437 MIP simplex iterations 329763 branch-and-bound nodes absmipgap = 0.130841, relmipgap = 8.07163e-05 4 cover cuts 113 flow-cover cuts 5 Gomory cuts 534 implied-bound cuts Solving problem with n=10 m=10 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.59 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1015 6930 MIP simplex iterations 603 branch-and-bound nodes 50 flow-cover cuts 11 Gomory cuts 176 implied-bound cuts Solving problem with n=10 m=10 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 34.45 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1540 346844 MIP simplex iterations 25033 branch-and-bound nodes 90 flow-cover cuts 21 Gomory cuts 507 implied-bound cuts Solving problem with n=10 m=10 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.97 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1932 3777 MIP simplex iterations 502 branch-and-bound nodes 17 flow-cover cuts 4 Gomory cuts 149 implied-bound cuts Solving problem with n=10 m=10 scen=2 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 551 1359 MIP simplex iterations 74 branch-and-bound nodes 20 flow-cover cuts 37 implied-bound cuts Solving problem with n=10 m=10 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 57.94 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1664 654809 MIP simplex iterations 45029 branch-and-bound nodes absmipgap = 2.28344e-07, relmipgap = 1.37226e-10 4 cover cuts 96 flow-cover cuts 1 Gomory cut 472 implied-bound cuts Solving problem with n=10 m=10 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 2.45 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1428 28224 MIP simplex iterations 1736 branch-and-bound nodes 2 cover cuts 87 flow-cover cuts 4 Gomory cuts 274 implied-bound cuts Solving problem with n=10 m=10 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.19 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1754 16653 MIP simplex iterations 1321 branch-and-bound nodes 56 flow-cover cuts 10 Gomory cuts 298 implied-bound cuts Solving problem with n=10 m=10 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.51 Output = 0 CPLEX 12.1.0: optimal (non-)integer solution within mipgap or absmipgap; objective 1148.99678 2806 MIP simplex iterations 208 branch-and-bound nodes absmipgap = 0.000150054, relmipgap = 1.30255e-07 1 integer variables rounded (maxerr = 5.7713e-06). Assigning integrality = 3e-06 might help. Currently integrality = 1e-05. 33 flow-cover cuts 3 Gomory cuts 34 implied-bound cuts Solving problem with n=10 m=10 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.69 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 490 41597 MIP simplex iterations 1818 branch-and-bound nodes 76 flow-cover cuts 1 Gomory cut 124 implied-bound cuts Solving problem with n=10 m=10 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 145.15 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2145 1266571 MIP simplex iterations 131990 branch-and-bound nodes absmipgap = 6.19426e-07, relmipgap = 2.88777e-10 3 cover cuts 102 flow-cover cuts 17 Gomory cuts 495 implied-bound cuts Solving problem with n=10 m=10 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 41.37 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2076 479929 MIP simplex iterations 38925 branch-and-bound nodes absmipgap = 1.16757e-06, relmipgap = 5.62413e-10 3 cover cuts 93 flow-cover cuts 11 Gomory cuts 484 implied-bound cuts Solving problem with n=10 m=10 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 167 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2652 1961040 MIP simplex iterations 107353 branch-and-bound nodes absmipgap = 0.257624, relmipgap = 9.71433e-05 9 cover cuts 179 flow-cover cuts 44 Gomory cuts 674 implied-bound cuts Solving problem with n=10 m=10 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 114.99 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2782 1138632 MIP simplex iterations 110326 branch-and-bound nodes 1 cover cut 93 flow-cover cuts 14 Gomory cuts 497 implied-bound cuts Solving problem with n=10 m=10 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 69.24 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1994 741356 MIP simplex iterations 53264 branch-and-bound nodes 2 cover cuts 115 flow-cover cuts 559 implied-bound cuts Solving problem with n=10 m=10 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 81.84 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2619 886485 MIP simplex iterations 66444 branch-and-bound nodes absmipgap = 0.144068, relmipgap = 5.50087e-05 8 cover cuts 114 flow-cover cuts 463 implied-bound cuts Solving problem with n=10 m=10 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 175.83 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2593 1747993 MIP simplex iterations 166435 branch-and-bound nodes absmipgap = 0.222963, relmipgap = 8.59864e-05 6 cover cuts 97 flow-cover cuts 591 implied-bound cuts Solving problem with n=10 m=10 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 38.93 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2855 385775 MIP simplex iterations 35351 branch-and-bound nodes absmipgap = 0.00779522, relmipgap = 2.73038e-06 2 cover cuts 89 flow-cover cuts 448 implied-bound cuts Solving problem with n=10 m=10 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 183.86 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2496 1640745 MIP simplex iterations 160313 branch-and-bound nodes 7 cover cuts 79 flow-cover cuts 14 Gomory cuts 536 implied-bound cuts Solving problem with n=10 m=10 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 27.37 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1626 269236 MIP simplex iterations 18207 branch-and-bound nodes 7 cover cuts 109 flow-cover cuts 506 implied-bound cuts Solving problem with n=10 m=10 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 219.63 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3073 1820053 MIP simplex iterations 221187 branch-and-bound nodes absmipgap = 0.231707, relmipgap = 7.5401e-05 10 cover cuts 104 flow-cover cuts 12 Gomory cuts 516 implied-bound cuts Solving problem with n=10 m=10 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.91 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2219 11236 MIP simplex iterations 1049 branch-and-bound nodes 36 flow-cover cuts 6 Gomory cuts 212 implied-bound cuts Solving problem with n=10 m=10 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 146.47 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2707 1905375 MIP simplex iterations 88501 branch-and-bound nodes 6 cover cuts 186 flow-cover cuts 21 Gomory cuts 639 implied-bound cuts Solving problem with n=10 m=10 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 7.01 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 3483 50724 MIP simplex iterations 5862 branch-and-bound nodes 51 flow-cover cuts 23 Gomory cuts 379 implied-bound cuts Solving problem with n=10 m=10 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.62 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1685 15970 MIP simplex iterations 1205 branch-and-bound nodes 39 flow-cover cuts 3 Gomory cuts 174 implied-bound cuts Solving problem with n=10 m=10 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 45.48 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2768 507778 MIP simplex iterations 39247 branch-and-bound nodes absmipgap = 0.212389, relmipgap = 7.67303e-05 4 cover cuts 99 flow-cover cuts 473 implied-bound cuts Solving problem with n=10 m=10 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 48.72 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 3019 486416 MIP simplex iterations 35693 branch-and-bound nodes 7 cover cuts 120 flow-cover cuts 16 Gomory cuts 452 implied-bound cuts Solving problem with n=10 m=10 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 23.16 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3280 202864 MIP simplex iterations 17212 branch-and-bound nodes absmipgap = 0.0465116, relmipgap = 1.41804e-05 1 cover cut 71 flow-cover cuts 9 Gomory cuts 537 implied-bound cuts Solving problem with n=10 m=10 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 14.99 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2342 190241 MIP simplex iterations 7543 branch-and-bound nodes 123 flow-cover cuts 15 Gomory cuts 429 implied-bound cuts Solving problem with n=10 m=10 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 13.42 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1107 166747 MIP simplex iterations 9023 branch-and-bound nodes absmipgap = 0.0348328, relmipgap = 3.14659e-05 2 cover cuts 104 flow-cover cuts 11 Gomory cuts 442 implied-bound cuts Solving problem with n=10 m=10 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 242.03 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3815 1996976 MIP simplex iterations 208796 branch-and-bound nodes absmipgap = 0.368421, relmipgap = 9.65717e-05 16 cover cuts 147 flow-cover cuts 32 Gomory cuts 537 implied-bound cuts