===================== USING MODEL: mub3 ===================== Solving problem with n=5 m=3 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 117 125 MIP simplex iterations 17 branch-and-bound nodes 14 flow-cover cuts 3 Gomory cuts 5 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.18 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 213 418 MIP simplex iterations 56 branch-and-bound nodes 10 flow-cover cuts 2 Gomory cuts 13 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 102 136 MIP simplex iterations 9 branch-and-bound nodes 14 flow-cover cuts 1 Gomory cut 10 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 169 264 MIP simplex iterations 31 branch-and-bound nodes 16 flow-cover cuts 3 Gomory cuts 11 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.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 165 318 MIP simplex iterations 34 branch-and-bound nodes 16 flow-cover cuts 7 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.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 111 121 MIP simplex iterations 12 branch-and-bound nodes 13 flow-cover cuts 5 Gomory cuts 7 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.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 117 183 MIP simplex iterations 20 branch-and-bound nodes 13 flow-cover cuts 1 Gomory cut 8 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 290 341 MIP simplex iterations 40 branch-and-bound nodes 15 flow-cover cuts 4 Gomory cuts 8 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.13 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 61 137 MIP simplex iterations 11 branch-and-bound nodes 11 flow-cover cuts 1 Gomory cut 4 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.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 100 101 MIP simplex iterations 10 branch-and-bound nodes 15 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 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 30 MIP simplex iterations 0 branch-and-bound nodes 3 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 122 MIP simplex iterations 15 branch-and-bound nodes 10 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 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 31 MIP simplex iterations 0 branch-and-bound nodes 2 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 33 MIP simplex iterations 0 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 5 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 196 202 MIP simplex iterations 22 branch-and-bound nodes 15 flow-cover cuts 11 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.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 107 67 MIP simplex iterations 0 branch-and-bound nodes 6 flow-cover cuts 2 Gomory cuts 6 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 153 34 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=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 251 113 MIP simplex iterations 13 branch-and-bound nodes 10 flow-cover cuts 2 Gomory cuts 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 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 62 38 MIP simplex iterations 0 branch-and-bound nodes 9 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 23 MIP simplex iterations 0 branch-and-bound nodes 2 flow-cover cuts Solving problem with n=5 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 210 233 MIP simplex iterations 33 branch-and-bound nodes 14 flow-cover cuts 2 Gomory cuts 14 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 318 321 MIP simplex iterations 50 branch-and-bound nodes 11 flow-cover cuts 21 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.18 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 250 246 MIP simplex iterations 28 branch-and-bound nodes 13 flow-cover cuts 15 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.13 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 393 312 MIP simplex iterations 55 branch-and-bound nodes 10 flow-cover cuts 1 Gomory cut 18 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.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 212 208 MIP simplex iterations 16 branch-and-bound nodes 17 flow-cover cuts 6 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 307 MIP simplex iterations 46 branch-and-bound nodes 6 flow-cover cuts 3 Gomory cuts 11 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.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 383 448 MIP simplex iterations 80 branch-and-bound nodes 16 flow-cover cuts 3 Gomory cuts 14 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 447 396 MIP simplex iterations 53 branch-and-bound nodes 20 flow-cover cuts 4 Gomory cuts 13 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 230 444 MIP simplex iterations 90 branch-and-bound nodes 14 flow-cover cuts 2 Gomory cuts 13 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.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 280 460 MIP simplex iterations 74 branch-and-bound nodes 18 flow-cover cuts 3 Gomory cuts 27 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 29 MIP simplex iterations 0 branch-and-bound nodes 2 flow-cover cuts 3 Gomory cuts 3 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 269 179 MIP simplex iterations 23 branch-and-bound nodes 12 flow-cover cuts 2 Gomory cuts 8 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 199 77 MIP simplex iterations 4 branch-and-bound nodes 9 flow-cover cuts 6 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 340 109 MIP simplex iterations 19 branch-and-bound nodes 10 flow-cover cuts 1 Gomory cut 10 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 277 225 MIP simplex iterations 28 branch-and-bound nodes 18 flow-cover cuts 10 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.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 408 99 MIP simplex iterations 9 branch-and-bound nodes 5 flow-cover cuts 3 Gomory cuts 8 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 471 203 MIP simplex iterations 35 branch-and-bound nodes 11 flow-cover cuts 2 Gomory cuts 10 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 297 MIP simplex iterations 32 branch-and-bound nodes 14 flow-cover cuts 3 Gomory cuts 12 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.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 129 53 MIP simplex iterations 1 branch-and-bound nodes 7 flow-cover 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 249 40 MIP simplex iterations 2 branch-and-bound nodes 5 flow-cover cuts 1 Gomory cut 4 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.56 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 371 34726 MIP simplex iterations 2125 branch-and-bound nodes 78 flow-cover cuts 33 Gomory cuts 83 implied-bound cuts 14 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 6.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 396 120584 MIP simplex iterations 7043 branch-and-bound nodes 105 flow-cover cuts 43 Gomory cuts 154 implied-bound cuts 88 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.01 Solve = 0.37 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 391 8098 MIP simplex iterations 604 branch-and-bound nodes 97 flow-cover cuts 9 Gomory cuts 41 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.04 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 388 21373 MIP simplex iterations 1546 branch-and-bound nodes 74 flow-cover cuts 27 Gomory cuts 54 implied-bound cuts 20 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.98 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 496 39304 MIP simplex iterations 2542 branch-and-bound nodes 61 flow-cover cuts 39 Gomory cuts 68 implied-bound cuts 64 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.9 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 358 25695 MIP simplex iterations 1528 branch-and-bound nodes absmipgap = 1.87583e-11, relmipgap = 5.23976e-14 99 flow-cover cuts 26 Gomory cuts 62 implied-bound cuts 82 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 = 1.38 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 358 28826 MIP simplex iterations 2368 branch-and-bound nodes 35 flow-cover cuts 9 Gomory cuts 9 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 = 6.41 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 809 72352 MIP simplex iterations 5864 branch-and-bound nodes absmipgap = 0.0243902, relmipgap = 3.01486e-05 2 cover cuts 110 flow-cover cuts 27 Gomory cuts 72 implied-bound cuts 40 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.65 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 336 32047 MIP simplex iterations 1611 branch-and-bound nodes 136 flow-cover cuts 29 Gomory cuts 72 implied-bound cuts 64 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.08 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 252 1069 MIP simplex iterations 66 branch-and-bound nodes 42 flow-cover cuts 5 Gomory cuts 8 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.16 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 147 436 MIP simplex iterations 30 branch-and-bound nodes 22 flow-cover cuts 11 Gomory cuts 7 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.07 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 200 1187 MIP simplex iterations 92 branch-and-bound nodes 55 flow-cover cuts 1 Gomory cut 16 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.24 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 421 540 MIP simplex iterations 66 branch-and-bound nodes 24 flow-cover cuts 9 Gomory cuts 23 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.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 211 371 MIP simplex iterations 21 branch-and-bound nodes 38 flow-cover cuts 5 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.01 Solve = 0.21 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 546 4086 MIP simplex iterations 441 branch-and-bound nodes 38 flow-cover cuts 2 Gomory cuts 69 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.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 247 2496 MIP simplex iterations 257 branch-and-bound nodes 52 flow-cover cuts 4 Gomory cuts 30 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 106 150 MIP simplex iterations 3 branch-and-bound nodes 11 flow-cover cuts 3 Gomory cuts Solving problem with n=10 m=3 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 381 1914 MIP simplex iterations 149 branch-and-bound nodes 78 flow-cover cuts 13 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.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 205 1431 MIP simplex iterations 167 branch-and-bound nodes 58 flow-cover cuts 4 Gomory cuts 17 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.07 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 117 172 MIP simplex iterations 0 branch-and-bound nodes 3 flow-cover cuts Solving problem with n=10 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 16.74 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 722 323120 MIP simplex iterations 30844 branch-and-bound nodes 86 flow-cover cuts 42 Gomory cuts 181 implied-bound cuts 23 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 18 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 565 327101 MIP simplex iterations 18720 branch-and-bound nodes absmipgap = 1.00773e-05, relmipgap = 1.78358e-08 110 flow-cover cuts 38 Gomory cuts 237 implied-bound cuts 56 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 Solve = 3.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 865 55075 MIP simplex iterations 6641 branch-and-bound nodes 52 flow-cover cuts 30 Gomory cuts 166 implied-bound cuts 66 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 Solve = 4.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 553 92635 MIP simplex iterations 7802 branch-and-bound nodes 85 flow-cover cuts 24 Gomory cuts 171 implied-bound cuts 58 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 873 102826 MIP simplex iterations 10305 branch-and-bound nodes 65 flow-cover cuts 18 Gomory cuts 165 implied-bound cuts 36 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 = 12.47 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 497 219363 MIP simplex iterations 15981 branch-and-bound nodes absmipgap = 0.0365667, relmipgap = 7.35748e-05 119 flow-cover cuts 34 Gomory cuts 117 implied-bound cuts 94 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 8.33 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 623 189383 MIP simplex iterations 16509 branch-and-bound nodes 101 flow-cover cuts 26 Gomory cuts 197 implied-bound cuts 26 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 = 4.86 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 809 73276 MIP simplex iterations 5164 branch-and-bound nodes absmipgap = 0.0742387, relmipgap = 9.1766e-05 124 flow-cover cuts 34 Gomory cuts 129 implied-bound cuts 42 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.91 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 424 128269 MIP simplex iterations 5693 branch-and-bound nodes 123 flow-cover cuts 25 Gomory cuts 144 implied-bound cuts 91 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.62 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 463 36551 MIP simplex iterations 2871 branch-and-bound nodes 60 flow-cover cuts 25 Gomory cuts 55 implied-bound cuts 10 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 = 1.5 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 720 29441 MIP simplex iterations 4525 branch-and-bound nodes absmipgap = 2.59888e-10, relmipgap = 3.60956e-13 16 flow-cover cuts 9 Gomory cuts 3 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 = 1.54 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 299 14286 MIP simplex iterations 1270 branch-and-bound nodes 41 flow-cover cuts 17 Gomory cuts 48 implied-bound cuts 15 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.01 Solve = 0.88 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1036 8160 MIP simplex iterations 1096 branch-and-bound nodes 41 flow-cover cuts 24 Gomory cuts 93 implied-bound cuts 22 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.07 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 496 1006 MIP simplex iterations 87 branch-and-bound nodes 49 flow-cover cuts 4 Gomory cuts 13 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 = 0.71 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1285 7608 MIP simplex iterations 1033 branch-and-bound nodes 10 flow-cover cuts 21 Gomory cuts 48 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.38 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 249 3149 MIP simplex iterations 218 branch-and-bound nodes 68 flow-cover cuts 8 Gomory cuts 37 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.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 424 2722 MIP simplex iterations 364 branch-and-bound nodes 34 flow-cover cuts 7 Gomory cuts 44 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.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 394 1642 MIP simplex iterations 116 branch-and-bound nodes 47 flow-cover cuts 2 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 Solve = 0.42 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 202 1508 MIP simplex iterations 138 branch-and-bound nodes 41 flow-cover cuts 6 Gomory cuts 22 implied-bound cuts Solving problem with n=10 m=3 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.06 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 427 674 MIP simplex iterations 86 branch-and-bound nodes 34 flow-cover cuts 5 Gomory cuts 17 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 7.92 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 659 113663 MIP simplex iterations 7470 branch-and-bound nodes 94 flow-cover cuts 20 Gomory cuts 376 implied-bound cuts 32 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 = 11.91 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 786 143669 MIP simplex iterations 11608 branch-and-bound nodes absmipgap = 0.00161794, relmipgap = 2.05844e-06 64 flow-cover cuts 17 Gomory cuts 301 implied-bound cuts 97 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.01 Solve = 8.44 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 685 102216 MIP simplex iterations 6941 branch-and-bound nodes 80 flow-cover cuts 12 Gomory cuts 280 implied-bound cuts 34 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 = 79.08 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1241 1180475 MIP simplex iterations 73878 branch-and-bound nodes absmipgap = 0.0734613, relmipgap = 5.91953e-05 90 flow-cover cuts 10 Gomory cuts 643 implied-bound cuts 62 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 = 28.49 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 930 381335 MIP simplex iterations 24283 branch-and-bound nodes absmipgap = 5.0653e-06, relmipgap = 5.44656e-09 108 flow-cover cuts 18 Gomory cuts 424 implied-bound cuts 62 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.3 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 238 4096 MIP simplex iterations 211 branch-and-bound nodes 55 flow-cover cuts 1 Gomory cut 66 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 = 51.07 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1477 797388 MIP simplex iterations 43004 branch-and-bound nodes absmipgap = 0.097647, relmipgap = 6.61117e-05 141 flow-cover cuts 32 Gomory cuts 334 implied-bound cuts 276 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 = 4 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 296 42828 MIP simplex iterations 1737 branch-and-bound nodes absmipgap = 1.13687e-13, relmipgap = 3.84077e-16 66 flow-cover cuts 8 Gomory cuts 165 implied-bound cuts 35 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 9.13 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 734 172833 MIP simplex iterations 12867 branch-and-bound nodes 30 flow-cover cuts 7 Gomory cuts 24 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 = 34.76 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 985 438693 MIP simplex iterations 33649 branch-and-bound nodes 114 flow-cover cuts 25 Gomory cuts 359 implied-bound cuts 85 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 = 0.57 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1001 6921 MIP simplex iterations 681 branch-and-bound nodes absmipgap = 4.5235e-05, relmipgap = 4.51898e-08 48 flow-cover cuts 2 Gomory cuts 94 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 2.83 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1163 22302 MIP simplex iterations 2095 branch-and-bound nodes 33 flow-cover cuts 23 Gomory cuts 148 implied-bound cuts 82 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 Solve = 0.41 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 919 4970 MIP simplex iterations 548 branch-and-bound nodes 34 flow-cover cuts 4 Gomory cuts 99 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=10 m=7 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 23.91 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1574 274971 MIP simplex iterations 27328 branch-and-bound nodes absmipgap = 0.100559, relmipgap = 6.38873e-05 41 flow-cover cuts 17 Gomory cuts 396 implied-bound cuts 77 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 = 5.15 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 987 37575 MIP simplex iterations 4265 branch-and-bound nodes 35 flow-cover cuts 14 Gomory cuts 234 implied-bound cuts 39 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.01 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 144 475 MIP simplex iterations 14 branch-and-bound nodes 25 flow-cover cuts 1 Gomory cut Solving problem with n=10 m=7 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 13.4 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2021 135137 MIP simplex iterations 8551 branch-and-bound nodes 73 flow-cover cuts 23 Gomory cuts 347 implied-bound cuts 159 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.07 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 211.9999959 639 MIP simplex iterations 28 branch-and-bound nodes 76 flow-cover cuts 23 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.44 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 701 6473 MIP simplex iterations 537 branch-and-bound nodes 44 flow-cover cuts 1 Gomory cut 109 implied-bound cuts 2 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.01 Solve = 6.26 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1309 55900 MIP simplex iterations 4637 branch-and-bound nodes 42 flow-cover cuts 41 Gomory cuts 294 implied-bound cuts 85 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.01 Solve = 67.98 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1805 743141 MIP simplex iterations 79345 branch-and-bound nodes absmipgap = 0.0111111, relmipgap = 6.15574e-06 1 cover cut 59 flow-cover cuts 27 Gomory cuts 453 implied-bound cuts 127 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 = 28.29 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1748 312769 MIP simplex iterations 28261 branch-and-bound nodes absmipgap = 5.39719e-05, relmipgap = 3.08764e-08 53 flow-cover cuts 15 Gomory cuts 389 implied-bound cuts 73 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 = 94 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1936 1008537 MIP simplex iterations 107366 branch-and-bound nodes absmipgap = 0.0857143, relmipgap = 4.42739e-05 7 cover cuts 94 flow-cover cuts 27 Gomory cuts 6 implied-bound cuts 94 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 = 98.88 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 2468 818356 MIP simplex iterations 88907 branch-and-bound nodes 3 cover cuts 87 flow-cover cuts 34 Gomory cuts 436 implied-bound cuts 168 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.01 Solve = 71.33 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1940 646592 MIP simplex iterations 70192 branch-and-bound nodes 1 cover cut 80 flow-cover cuts 31 Gomory cuts 398 implied-bound cuts 40 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.01 Solve = 46.88 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 892 637557 MIP simplex iterations 46164 branch-and-bound nodes absmipgap = 0.0823529, relmipgap = 9.23239e-05 108 flow-cover cuts 13 Gomory cuts 350 implied-bound cuts 169 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.01 Solve = 38.09 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2370 429650 MIP simplex iterations 34308 branch-and-bound nodes absmipgap = 0.00422197, relmipgap = 1.78142e-06 2 cover cuts 57 flow-cover cuts 18 Gomory cuts 436 implied-bound cuts 123 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.01 Solve = 87.67 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1193 1093443 MIP simplex iterations 94269 branch-and-bound nodes absmipgap = 0.108177, relmipgap = 9.06764e-05 1 cover cut 94 flow-cover cuts 18 Gomory cuts 537 implied-bound cuts 82 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 54.62 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1734 822844 MIP simplex iterations 79475 branch-and-bound nodes absmipgap = 0.00127205, relmipgap = 7.33594e-07 1 cover cut 51 flow-cover cuts 29 Gomory cuts 482 implied-bound cuts 113 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 = 105.26 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2197 953223 MIP simplex iterations 116017 branch-and-bound nodes absmipgap = 0.0192308, relmipgap = 8.75319e-06 73 flow-cover cuts 29 Gomory cuts 535 implied-bound cuts 172 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.32 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 2270 72490 MIP simplex iterations 7623 branch-and-bound nodes 37 flow-cover cuts 24 Gomory cuts 249 implied-bound cuts 94 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 Solve = 8.2 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2245 72072 MIP simplex iterations 7506 branch-and-bound nodes 25 flow-cover cuts 22 Gomory cuts 254 implied-bound cuts 49 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 = 11.88 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 2152 107150 MIP simplex iterations 11818 branch-and-bound nodes 1 cover cut 28 flow-cover cuts 25 Gomory cuts 336 implied-bound cuts 88 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 Solve = 117.48 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3096 945478 MIP simplex iterations 100973 branch-and-bound nodes absmipgap = 0.265306, relmipgap = 8.56932e-05 5 cover cuts 51 flow-cover cuts 40 Gomory cuts 523 implied-bound cuts 149 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 Solve = 14.84 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2141 182646 MIP simplex iterations 20299 branch-and-bound nodes absmipgap = 6.12378e-05, relmipgap = 2.86024e-08 1 cover cut 51 flow-cover cuts 43 Gomory cuts 298 implied-bound cuts 135 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.01 Solve = 0.2 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 234 685 MIP simplex iterations 42 branch-and-bound nodes 28 flow-cover cuts 4 Gomory cuts 9 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 = 45.11 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3194 497021 MIP simplex iterations 47133 branch-and-bound nodes 2 cover cuts 47 flow-cover cuts 29 Gomory cuts 442 implied-bound cuts 147 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 Solve = 4.64 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1183 51695 MIP simplex iterations 4327 branch-and-bound nodes 42 flow-cover cuts 17 Gomory cuts 265 implied-bound cuts 48 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.49 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1667 34539 MIP simplex iterations 3315 branch-and-bound nodes 14 flow-cover cuts 25 Gomory cuts 230 implied-bound cuts 25 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 = 35.08 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2845 300645 MIP simplex iterations 44556 branch-and-bound nodes absmipgap = 2.05478e-05, relmipgap = 7.22243e-09 1 cover cut 30 flow-cover cuts 26 Gomory cuts 362 implied-bound cuts 94 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 = 2.16 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 707 18916 MIP simplex iterations 1180 branch-and-bound nodes absmipgap = 1.13687e-13, relmipgap = 1.60802e-16 46 flow-cover cuts 15 Gomory cuts 225 implied-bound cuts 36 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 = 144.8 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1643 1713535 MIP simplex iterations 115164 branch-and-bound nodes absmipgap = 0.0826965, relmipgap = 5.03326e-05 1 cover cut 100 flow-cover cuts 45 Gomory cuts 654 implied-bound cuts 297 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 = 8 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1200 111791 MIP simplex iterations 6518 branch-and-bound nodes 45 flow-cover cuts 21 Gomory cuts 536 implied-bound cuts 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 = 5.78 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 681 61438 MIP simplex iterations 3431 branch-and-bound nodes 64 flow-cover cuts 13 Gomory cuts 293 implied-bound cuts 102 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 = 68.69 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1529 875870 MIP simplex iterations 46365 branch-and-bound nodes absmipgap = 0.141553, relmipgap = 9.25791e-05 135 flow-cover cuts 15 Gomory cuts 548 implied-bound cuts 111 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 Solve = 21.88 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1162 203951 MIP simplex iterations 13089 branch-and-bound nodes absmipgap = 3.05759e-05, relmipgap = 2.63131e-08 112 flow-cover cuts 31 Gomory cuts 500 implied-bound cuts 117 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 = 35.19 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1609 430034 MIP simplex iterations 25530 branch-and-bound nodes absmipgap = 0.0487295, relmipgap = 3.02856e-05 46 flow-cover cuts 41 Gomory cuts 517 implied-bound cuts 197 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 = 20.55 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 912 268854 MIP simplex iterations 11534 branch-and-bound nodes absmipgap = 0.0425532, relmipgap = 4.66592e-05 73 flow-cover cuts 17 Gomory cuts 380 implied-bound cuts 112 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 Solve = 27.08 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 908 421758 MIP simplex iterations 16054 branch-and-bound nodes 111 flow-cover cuts 12 Gomory cuts 494 implied-bound cuts 143 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 = 284.93 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1621 2631425 MIP simplex iterations 205378 branch-and-bound nodes absmipgap = 0.0560748, relmipgap = 3.45927e-05 127 flow-cover cuts 52 Gomory cuts 506 implied-bound cuts 124 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.01 Solve = 1.07 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1015 7351 MIP simplex iterations 608 branch-and-bound nodes absmipgap = 2.27374e-13, relmipgap = 2.24013e-16 19 flow-cover cuts 14 Gomory cuts 71 implied-bound cuts 69 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.01 Solve = 12.23 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1540 175015 MIP simplex iterations 11289 branch-and-bound nodes 57 flow-cover cuts 34 Gomory cuts 373 implied-bound cuts 179 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 = 0.53 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1932 4015 MIP simplex iterations 500 branch-and-bound nodes 10 flow-cover cuts 1 Gomory cut 127 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.29 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 551 711 MIP simplex iterations 75 branch-and-bound nodes 31 flow-cover cuts 54 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 = 49.91 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1664 517006 MIP simplex iterations 33498 branch-and-bound nodes 1 cover cut 78 flow-cover cuts 25 Gomory cuts 557 implied-bound cuts 141 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 = 2.59 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1428 25709 MIP simplex iterations 1471 branch-and-bound nodes 49 flow-cover cuts 32 Gomory cuts 222 implied-bound cuts 148 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 = 1.91 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1754 15222 MIP simplex iterations 1257 branch-and-bound nodes absmipgap = 0.0851344, relmipgap = 4.85373e-05 15 flow-cover cuts 24 Gomory cuts 295 implied-bound cuts 39 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 = 0.25 Output = 0 CPLEX 12.1.0: optimal (non-)integer solution; objective 1148.99678 1008 MIP simplex iterations 50 branch-and-bound nodes 1 integer variables rounded (maxerr = 5.7713e-06). Assigning integrality = 3e-06 might help. Currently integrality = 1e-05. 45 flow-cover cuts 23 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 = 2.58 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 490 32926 MIP simplex iterations 1459 branch-and-bound nodes 51 flow-cover cuts 19 Gomory cuts 49 implied-bound cuts 21 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 = 102.95 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2145 884025 MIP simplex iterations 78981 branch-and-bound nodes absmipgap = 0.114504, relmipgap = 5.33817e-05 64 flow-cover cuts 35 Gomory cuts 582 implied-bound cuts 138 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 Solve = 27.76 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2076 258691 MIP simplex iterations 19346 branch-and-bound nodes 62 flow-cover cuts 19 Gomory cuts 531 implied-bound cuts 32 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 Solve = 76.25 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2652 828941 MIP simplex iterations 65067 branch-and-bound nodes absmipgap = 0.130435, relmipgap = 4.91836e-05 2 cover cuts 86 flow-cover cuts 15 Gomory cuts 500 implied-bound cuts 256 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 Solve = 68.6 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2782 586478 MIP simplex iterations 65834 branch-and-bound nodes absmipgap = 0.00424628, relmipgap = 1.52634e-06 4 cover cuts 36 flow-cover cuts 47 Gomory cuts 449 implied-bound cuts 139 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 = 52.01 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1994 612795 MIP simplex iterations 39524 branch-and-bound nodes absmipgap = 0.0296296, relmipgap = 1.48594e-05 1 cover cut 92 flow-cover cuts 23 Gomory cuts 555 implied-bound cuts 254 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 = 49.85 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2619 587904 MIP simplex iterations 42586 branch-and-bound nodes absmipgap = 1.02272e-05, relmipgap = 3.905e-09 3 cover cuts 113 flow-cover cuts 37 Gomory cuts 397 implied-bound cuts 283 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 Solve = 133.56 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2593 1129247 MIP simplex iterations 100960 branch-and-bound nodes absmipgap = 0.00894555, relmipgap = 3.44988e-06 1 cover cut 112 flow-cover cuts 25 Gomory cuts 583 implied-bound cuts 162 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 = 29.56 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2855 265311 MIP simplex iterations 22869 branch-and-bound nodes 49 flow-cover cuts 49 Gomory cuts 537 implied-bound cuts 202 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 144.89 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2496 1616239 MIP simplex iterations 120455 branch-and-bound nodes absmipgap = 0.194857, relmipgap = 7.80675e-05 1 cover cut 63 flow-cover cuts 24 Gomory cuts 548 implied-bound cuts 129 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 = 30.33 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1626 398296 MIP simplex iterations 18556 branch-and-bound nodes absmipgap = 0.0719109, relmipgap = 4.42256e-05 1 cover cut 96 flow-cover cuts 14 Gomory cuts 593 implied-bound cuts 181 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 = 183.74 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 3073 1556461 MIP simplex iterations 168422 branch-and-bound nodes 6 cover cuts 73 flow-cover cuts 59 Gomory cuts 443 implied-bound cuts 135 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 = 1.89 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2219 13030 MIP simplex iterations 1065 branch-and-bound nodes 19 flow-cover cuts 30 Gomory cuts 214 implied-bound cuts 76 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 = 56.12 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2707 589872 MIP simplex iterations 45712 branch-and-bound nodes absmipgap = 0.0555865, relmipgap = 2.05343e-05 1 cover cut 58 flow-cover cuts 30 Gomory cuts 574 implied-bound cuts 203 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 Solve = 6.85 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3483 84955 MIP simplex iterations 6568 branch-and-bound nodes 1 cover cut 27 flow-cover cuts 35 Gomory cuts 308 implied-bound cuts 105 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 = 2.4 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1685 21356 MIP simplex iterations 1172 branch-and-bound nodes 36 flow-cover cuts 26 Gomory cuts 216 implied-bound cuts 86 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 = 34.41 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2768 426562 MIP simplex iterations 26294 branch-and-bound nodes absmipgap = 4.1274e-05, relmipgap = 1.49111e-08 1 cover cut 94 flow-cover cuts 47 Gomory cuts 576 implied-bound cuts 184 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 = 21.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3019 215208 MIP simplex iterations 20014 branch-and-bound nodes 69 flow-cover cuts 26 Gomory cuts 351 implied-bound cuts 127 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 = 16.74 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3280 196320 MIP simplex iterations 14838 branch-and-bound nodes 30 flow-cover cuts 39 Gomory cuts 542 implied-bound cuts 101 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 6.57 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 2342 65125 MIP simplex iterations 3600 branch-and-bound nodes 38 flow-cover cuts 6 Gomory cuts 291 implied-bound cuts 43 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 = 10.3 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1107 145047 MIP simplex iterations 7603 branch-and-bound nodes 57 flow-cover cuts 38 Gomory cuts 406 implied-bound cuts 61 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 = 168.32 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3815 1369452 MIP simplex iterations 163494 branch-and-bound nodes absmipgap = 0.381329, relmipgap = 9.99551e-05 4 cover cuts 59 flow-cover cuts 74 Gomory cuts 451 implied-bound cuts 138 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 = 443.35 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 904 6300992 MIP simplex iterations 411487 branch-and-bound nodes absmipgap = 0.0859259, relmipgap = 9.50508e-05 133 cover cuts 190 flow-cover cuts 60 Gomory cuts 287 implied-bound cuts 82 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.01 Solve = 563.26 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 927 9081830 MIP simplex iterations 1013381 branch-and-bound nodes absmipgap = 0.08, relmipgap = 8.62999e-05 59 flow-cover cuts 15 Gomory cuts 9 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 = 1737.44 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1078 22322975 MIP simplex iterations 1407494 branch-and-bound nodes absmipgap = 0.107715, relmipgap = 9.99215e-05 434 cover cuts 198 flow-cover cuts 45 Gomory cuts 325 implied-bound cuts 41 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 = 64.08 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 767 973541 MIP simplex iterations 58557 branch-and-bound nodes absmipgap = 0.0734957, relmipgap = 9.58223e-05 19 cover cuts 143 flow-cover cuts 51 Gomory cuts 172 implied-bound cuts 69 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 = 63.43 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 650 862190 MIP simplex iterations 53236 branch-and-bound nodes absmipgap = 0.0593806, relmipgap = 9.13547e-05 162 flow-cover cuts 64 Gomory cuts 278 implied-bound cuts 60 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 = 7.63 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 492 114893 MIP simplex iterations 6677 branch-and-bound nodes 163 flow-cover cuts 49 Gomory cuts 151 implied-bound cuts 62 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 = 16.83 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 409 290135 MIP simplex iterations 13663 branch-and-bound nodes absmipgap = 0.033858, relmipgap = 8.27823e-05 149 flow-cover cuts 50 Gomory cuts 155 implied-bound cuts 26 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.01 Solve = 35.11 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 953 470078 MIP simplex iterations 28087 branch-and-bound nodes absmipgap = 0.0878452, relmipgap = 9.21776e-05 251 flow-cover cuts 76 Gomory cuts 225 implied-bound cuts 198 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 = 434.94 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 936 5825949 MIP simplex iterations 655733 branch-and-bound nodes absmipgap = 0.0923058, relmipgap = 9.86173e-05 65 flow-cover cuts 11 Gomory cuts 3 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 Solve = 30.22 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 703 477822 MIP simplex iterations 35770 branch-and-bound nodes absmipgap = 0.0663874, relmipgap = 9.44344e-05 3 cover cuts 168 flow-cover cuts 28 Gomory cuts 157 implied-bound cuts 65 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.01 Solve = 0.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 145 617 MIP simplex iterations 34 branch-and-bound nodes 38 flow-cover cuts 46 Gomory cuts 7 implied-bound cuts Solving problem with n=15 m=3 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.04 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 518 35948 MIP simplex iterations 2451 branch-and-bound nodes 66 flow-cover cuts 35 Gomory cuts 67 implied-bound cuts 25 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.77 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 436 17018 MIP simplex iterations 882 branch-and-bound nodes 88 flow-cover cuts 45 Gomory cuts 61 implied-bound cuts 34 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.01 Solve = 0.07 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 214 641 MIP simplex iterations 27 branch-and-bound nodes 42 flow-cover cuts 19 Gomory cuts 2 implied-bound cuts Solving problem with n=15 m=3 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.16 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 305 1994 MIP simplex iterations 114 branch-and-bound nodes 68 flow-cover cuts 9 Gomory cuts 6 implied-bound cuts Solving problem with n=15 m=3 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.07 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 162 580 MIP simplex iterations 32 branch-and-bound nodes 45 flow-cover cuts 17 Gomory cuts 12 implied-bound cuts Solving problem with n=15 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 95 532 MIP simplex iterations 4 branch-and-bound nodes 29 flow-cover cuts 11 Gomory cuts Solving problem with n=15 m=3 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.04 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 640 8318 MIP simplex iterations 538 branch-and-bound nodes 155 flow-cover cuts 15 Gomory cuts 66 implied-bound cuts Solving problem with n=15 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.34 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 546 69110 MIP simplex iterations 5880 branch-and-bound nodes 85 flow-cover cuts 29 Gomory cuts 64 implied-bound cuts 44 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.01 Solve = 0.3 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 335 3189 MIP simplex iterations 315 branch-and-bound nodes 109 flow-cover cuts 9 Gomory cuts 16 implied-bound cuts Solving problem with n=15 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 7616.94 Output = 0.03 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1069 86812215 MIP simplex iterations 7429432 branch-and-bound nodes absmipgap = 0.106734, relmipgap = 9.98446e-05 61 cover cuts 212 flow-cover cuts 75 Gomory cuts 306 implied-bound cuts 77 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.01 Solve = 6329.09 Output = 0.03 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1180 68000702 MIP simplex iterations 5060286 branch-and-bound nodes absmipgap = 0.112676, relmipgap = 9.54882e-05 183 cover cuts 212 flow-cover cuts 67 Gomory cuts 387 implied-bound cuts 119 mixed-integer rounding cuts