===================== USING MODEL: mub2 ===================== Solving problem with n=5 m=3 scen=1 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 117 76 MIP simplex iterations 8 branch-and-bound nodes 3 Gomory cuts Solving problem with n=5 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 213 177 MIP simplex iterations 25 branch-and-bound nodes 4 flow-cover cuts 2 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 102 0 MIP simplex iterations 0 branch-and-bound nodes Solving problem with n=5 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 169 94 MIP simplex iterations 5 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 5 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 165 48 MIP simplex iterations 5 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 1 implied-bound cut Solving problem with n=5 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 111 89 MIP simplex iterations 10 branch-and-bound nodes 4 Gomory cuts Solving problem with n=5 m=3 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 117 58 MIP simplex iterations 7 branch-and-bound nodes 1 Gomory cut Solving problem with n=5 m=3 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 290 80 MIP simplex iterations 8 branch-and-bound nodes 3 flow-cover cuts 2 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 61 50 MIP simplex iterations 0 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 1 implied-bound cut Solving problem with n=5 m=3 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 100 57 MIP simplex iterations 0 branch-and-bound nodes Solving problem with n=5 m=3 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 43 168 MIP simplex iterations 15 branch-and-bound nodes Solving problem with n=5 m=3 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 165 161 MIP simplex iterations 23 branch-and-bound nodes 2 flow-cover cuts 2 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 85 MIP simplex iterations 0 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 102 193 MIP simplex iterations 12 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 4 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 196 129 MIP simplex iterations 24 branch-and-bound nodes 4 flow-cover cuts 2 Gomory cuts 5 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 107 117 MIP simplex iterations 12 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 8 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 153 207 MIP simplex iterations 21 branch-and-bound nodes 3 Gomory cuts 3 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 251 121 MIP simplex iterations 14 branch-and-bound nodes 4 flow-cover cuts 2 Gomory cuts 3 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 62 86 MIP simplex iterations 4 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 2 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 86 130 MIP simplex iterations 0 branch-and-bound nodes 1 Gomory cut 1 implied-bound cut Solving problem with n=5 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 210 78 MIP simplex iterations 2 branch-and-bound nodes absmipgap = 5.68434e-14, relmipgap = 2.70683e-16 1 flow-cover cut 2 Gomory cuts Solving problem with n=5 m=3 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 318 152 MIP simplex iterations 11 branch-and-bound nodes 6 flow-cover cuts 2 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 250 62 MIP simplex iterations 3 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts 4 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.04 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 393 196 MIP simplex iterations 14 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut 6 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 212 84 MIP simplex iterations 14 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 4 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 50 MIP simplex iterations 4 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts 2 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 383 90 MIP simplex iterations 5 branch-and-bound nodes absmipgap = 5.68434e-14, relmipgap = 1.48416e-16 4 flow-cover cuts 1 Gomory cut 1 implied-bound cut Solving problem with n=5 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.04 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 447 83 MIP simplex iterations 6 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 3 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 128 MIP simplex iterations 7 branch-and-bound nodes 5 flow-cover cuts 3 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 280 135 MIP simplex iterations 19 branch-and-bound nodes 3 flow-cover cuts 2 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 108 0 MIP simplex iterations 0 branch-and-bound nodes 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 194 MIP simplex iterations 25 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 4 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 199 80 MIP simplex iterations 6 branch-and-bound nodes 1 flow-cover cut 3 Gomory 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.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 340 237 MIP simplex iterations 30 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 6 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 277 175 MIP simplex iterations 29 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 7 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.13 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 408 90 MIP simplex iterations 16 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts 5 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 471 81 MIP simplex iterations 13 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 417 128 MIP simplex iterations 11 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 9 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 129 118 MIP simplex iterations 9 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 4 implied-bound 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 185 MIP simplex iterations 14 branch-and-bound nodes 3 flow-cover cuts 9 implied-bound cuts Solving problem with n=10 m=3 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.24 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 371 1341 MIP simplex iterations 123 branch-and-bound nodes absmipgap = 0.0196956, relmipgap = 5.30879e-05 3 flow-cover cuts 3 Gomory cuts Solving problem with n=10 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.25 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 396 6048 MIP simplex iterations 516 branch-and-bound nodes absmipgap = 3.06954e-12, relmipgap = 7.75138e-15 7 Gomory cuts 6 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.6 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 391 9776 MIP simplex iterations 588 branch-and-bound nodes absmipgap = 1.24658e-10, relmipgap = 3.18817e-13 2 Gomory cuts 16 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.27 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 388 4531 MIP simplex iterations 541 branch-and-bound nodes 4 Gomory cuts Solving problem with n=10 m=3 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.28 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 496 4855 MIP simplex iterations 457 branch-and-bound nodes 2 flow-cover cuts 4 Gomory cuts Solving problem with n=10 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 358 509 MIP simplex iterations 42 branch-and-bound nodes 1 Gomory cut Solving problem with n=10 m=3 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 358 10406 MIP simplex iterations 578 branch-and-bound nodes 3 Gomory cuts 8 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 Solve = 0.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 809 2442 MIP simplex iterations 414 branch-and-bound nodes Solving problem with n=10 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 336 4125 MIP simplex iterations 347 branch-and-bound nodes 2 flow-cover cuts 4 Gomory cuts Solving problem with n=10 m=3 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.15 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 252 964 MIP simplex iterations 91 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts Solving problem with n=10 m=3 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 147 2670 MIP simplex iterations 171 branch-and-bound nodes 5 flow-cover cuts 2 Gomory cuts 10 implied-bound cuts 6 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.78 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 200 8286 MIP simplex iterations 557 branch-and-bound nodes 2 Gomory cuts 21 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.25 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 421 27388 MIP simplex iterations 1222 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 15 implied-bound cuts 44 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.19 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 211 4343 MIP simplex iterations 342 branch-and-bound nodes 6 flow-cover cuts 2 Gomory cuts 7 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=10 m=3 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 546 3132 MIP simplex iterations 184 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts 5 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.41 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 247 4900 MIP simplex iterations 467 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts Solving problem with n=10 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.37 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 106 7769 MIP simplex iterations 461 branch-and-bound nodes 2 flow-cover cuts Solving problem with n=10 m=3 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.24 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 381 7845 MIP simplex iterations 622 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts Solving problem with n=10 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 205 8729 MIP simplex iterations 559 branch-and-bound nodes 3 Gomory cuts 32 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.56 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 117 13523 MIP simplex iterations 551 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 7 implied-bound cuts 6 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.61 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 722 8064 MIP simplex iterations 585 branch-and-bound nodes absmipgap = 1.13687e-13, relmipgap = 1.57461e-16 5 Gomory cuts 16 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 = 0.56 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 565 7428 MIP simplex iterations 567 branch-and-bound nodes absmipgap = 1.02318e-12, relmipgap = 1.81094e-15 4 Gomory cuts 16 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.79 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 865 14833 MIP simplex iterations 966 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts 5 implied-bound cuts 14 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.62 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 553 8107 MIP simplex iterations 514 branch-and-bound nodes absmipgap = 2.27374e-13, relmipgap = 4.11164e-16 3 flow-cover cuts 5 Gomory cuts 4 implied-bound cuts 12 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 = 0.86 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 873 6621 MIP simplex iterations 634 branch-and-bound nodes absmipgap = 2.27374e-13, relmipgap = 2.60451e-16 1 flow-cover cut 7 Gomory cuts 4 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 497 1570 MIP simplex iterations 256 branch-and-bound nodes 2 flow-cover cuts 3 Gomory cuts Solving problem with n=10 m=3 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.81 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 623 8839 MIP simplex iterations 691 branch-and-bound nodes 5 Gomory cuts 7 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.07 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 809 1125 MIP simplex iterations 181 branch-and-bound nodes 1 Gomory cut Solving problem with n=10 m=3 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 424 4553 MIP simplex iterations 448 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts Solving problem with n=10 m=3 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.93 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 463 12715 MIP simplex iterations 595 branch-and-bound nodes absmipgap = 5.68434e-13, relmipgap = 1.22772e-15 6 Gomory cuts 18 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.71 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 720 12825 MIP simplex iterations 806 branch-and-bound nodes 3 flow-cover cuts 4 Gomory cuts 8 implied-bound cuts 22 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.01 Solve = 0.52 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 299 10917 MIP simplex iterations 575 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts 3 implied-bound cuts 22 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.77 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1036 10720 MIP simplex iterations 596 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 9 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 = 1.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 496 12368 MIP simplex iterations 542 branch-and-bound nodes absmipgap = 1.25056e-12, relmipgap = 2.52128e-15 2 flow-cover cuts 1 Gomory cut 12 implied-bound cuts 10 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.23 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1285 4421 MIP simplex iterations 357 branch-and-bound nodes 11 flow-cover cuts 4 Gomory cuts 28 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.52 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 249 4797 MIP simplex iterations 434 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts Solving problem with n=10 m=3 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.29 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 424 16621 MIP simplex iterations 935 branch-and-bound nodes 2 flow-cover cuts 4 Gomory cuts 7 implied-bound cuts 20 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.33 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 394 10752 MIP simplex iterations 672 branch-and-bound nodes 3 flow-cover cuts 4 Gomory cuts Solving problem with n=10 m=3 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.68 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 202 11298 MIP simplex iterations 522 branch-and-bound nodes 1 Gomory cut 31 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.29 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 427 7613 MIP simplex iterations 505 branch-and-bound nodes 11 flow-cover cuts 29 implied-bound cuts 8 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.62 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 659 26209 MIP simplex iterations 1160 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts 18 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.01 Solve = 1.67 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 786 31686 MIP simplex iterations 1472 branch-and-bound nodes 1 flow-cover cut 7 Gomory cuts 7 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 685 21342 MIP simplex iterations 752 branch-and-bound nodes 2 flow-cover cuts 4 Gomory cuts 5 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 = 1.41 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1241 19478 MIP simplex iterations 861 branch-and-bound nodes absmipgap = 1.06866e-11, relmipgap = 8.61125e-15 1 flow-cover cut 2 Gomory cuts 12 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.15 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 930 17859 MIP simplex iterations 817 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts 8 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.19 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 238 4933 MIP simplex iterations 229 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts Solving problem with n=10 m=7 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.7 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1477 24640 MIP simplex iterations 925 branch-and-bound nodes 2 Gomory cuts 5 implied-bound cuts 6 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.5 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 296 5562 MIP simplex iterations 242 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts Solving problem with n=10 m=7 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.67 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 734 23065 MIP simplex iterations 1112 branch-and-bound nodes 4 Gomory cuts 13 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.01 Solve = 1.82 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 985 24678 MIP simplex iterations 1078 branch-and-bound nodes 1 flow-cover cut 8 Gomory cuts 7 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 = 1.83 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1001 21963 MIP simplex iterations 956 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut 5 implied-bound cuts 15 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.96 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1163 29606 MIP simplex iterations 1635 branch-and-bound nodes 4 flow-cover cuts 4 Gomory cuts 10 implied-bound cuts 8 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 = 2.51 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 919 39508 MIP simplex iterations 1412 branch-and-bound nodes 8 flow-cover cuts 1 Gomory cut 14 implied-bound cuts 25 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.58 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1574 16410 MIP simplex iterations 926 branch-and-bound nodes 4 flow-cover cuts 6 Gomory cuts 10 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 Solve = 3.88 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 987 58203 MIP simplex iterations 2979 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 11 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 144 15956 MIP simplex iterations 549 branch-and-bound nodes 34 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.7 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2021 20156 MIP simplex iterations 703 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts 3 implied-bound cuts 5 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 = 1.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 212 20329 MIP simplex iterations 518 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts 13 implied-bound cuts 17 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.77 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 701 34747 MIP simplex iterations 1130 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 8 implied-bound cuts 18 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 = 1.64 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1309 18892 MIP simplex iterations 795 branch-and-bound nodes 3 flow-cover cuts 2 Gomory cuts 4 implied-bound cuts 10 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.71 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1805 22250 MIP simplex iterations 1712 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 1 implied-bound cut 4 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.2 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1748 21832 MIP simplex iterations 1352 branch-and-bound nodes absmipgap = 0.102741, relmipgap = 5.87763e-05 2 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 4 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 = 2.48 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1936 39502 MIP simplex iterations 1880 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 3 implied-bound cuts 7 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 = 0.96 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2468 12716 MIP simplex iterations 772 branch-and-bound nodes 2 flow-cover cuts 5 Gomory cuts 9 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 = 2.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1940 29301 MIP simplex iterations 1526 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut 7 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.39 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 892 58544 MIP simplex iterations 2435 branch-and-bound nodes absmipgap = 0.0507313, relmipgap = 5.68737e-05 5 Gomory cuts 22 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.57 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2370 16985 MIP simplex iterations 724 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 6 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 = 0.94 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1193 14830 MIP simplex iterations 796 branch-and-bound nodes 2 flow-cover cuts 6 Gomory cuts 2 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.01 Solve = 2.37 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1734 35613 MIP simplex iterations 2006 branch-and-bound nodes absmipgap = 0.166017, relmipgap = 9.57424e-05 3 flow-cover cuts 3 Gomory cuts 3 implied-bound cuts 8 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 = 1.78 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2197 26300 MIP simplex iterations 1235 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 2 implied-bound cuts 9 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 = 1.24 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2270 15879 MIP simplex iterations 1135 branch-and-bound nodes absmipgap = 2.27374e-12, relmipgap = 1.00165e-15 2 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 8 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.54 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 2245 27892 MIP simplex iterations 1627 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 5 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 = 1.71 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2152 28231 MIP simplex iterations 1266 branch-and-bound nodes 3 flow-cover cuts 1 implied-bound cut 6 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.83 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3096 9782 MIP simplex iterations 678 branch-and-bound nodes 6 Gomory cuts 10 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 = 0.59 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2141 11233 MIP simplex iterations 590 branch-and-bound nodes 4 flow-cover cuts 2 Gomory cuts 7 implied-bound cuts 2 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 = 1.65 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 234 24909 MIP simplex iterations 898 branch-and-bound nodes 2 flow-cover cuts 16 implied-bound cuts 9 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.73 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3194 21027 MIP simplex iterations 874 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 3 implied-bound cuts 7 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.2 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1183 15531 MIP simplex iterations 654 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 5 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 = 1.77 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1667 26753 MIP simplex iterations 1150 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 10 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.38 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2845 31548 MIP simplex iterations 1686 branch-and-bound nodes 3 Gomory cuts 12 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.69 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 707 38151 MIP simplex iterations 1192 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 3 implied-bound cuts 17 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 = 7.83 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1643 156572 MIP simplex iterations 6807 branch-and-bound nodes absmipgap = 0.0923807, relmipgap = 5.62269e-05 1 Gomory cut 3 implied-bound cuts 8 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.01 Solve = 3.48 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1200 49932 MIP simplex iterations 2011 branch-and-bound nodes 2 Gomory cuts 4 implied-bound cuts 5 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.62 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 681 46428 MIP simplex iterations 1139 branch-and-bound nodes 1 Gomory cut 27 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 = 4.45 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1529 57361 MIP simplex iterations 2342 branch-and-bound nodes absmipgap = 0.0844216, relmipgap = 5.52136e-05 2 Gomory cuts 2 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 2.22 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1162 33868 MIP simplex iterations 1213 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts 8 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 = 2.26 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1609 26551 MIP simplex iterations 1107 branch-and-bound nodes absmipgap = 1.81899e-12, relmipgap = 1.13051e-15 1 Gomory cut 7 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.01 Solve = 2.34 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 912 29063 MIP simplex iterations 877 branch-and-bound nodes 5 implied-bound cuts 28 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 3.74 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 908 46218 MIP simplex iterations 1375 branch-and-bound nodes 2 Gomory cuts 6 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 = 3.69 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1621 53175 MIP simplex iterations 2549 branch-and-bound nodes 4 Gomory cuts 6 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1015 81802 MIP simplex iterations 2690 branch-and-bound nodes 9 flow-cover cuts 2 Gomory cuts 17 implied-bound cuts 33 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.11 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1540 91668 MIP simplex iterations 3464 branch-and-bound nodes absmipgap = 0.0328654, relmipgap = 2.13412e-05 1 Gomory cut 10 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 = 6.62 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1932 124959 MIP simplex iterations 4755 branch-and-bound nodes absmipgap = 0.109826, relmipgap = 5.68457e-05 10 flow-cover cuts 2 Gomory cuts 16 implied-bound cuts 10 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 2.56 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 551 45030 MIP simplex iterations 937 branch-and-bound nodes 3 flow-cover cuts 8 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=10 m=10 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.61 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1664 72668 MIP simplex iterations 3033 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 2 implied-bound cuts 7 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.01 Solve = 3.07 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1428 40352 MIP simplex iterations 1314 branch-and-bound nodes 6 flow-cover cuts 1 Gomory cut 8 implied-bound cuts 16 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.74 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1754 18411 MIP simplex iterations 647 branch-and-bound nodes absmipgap = 0.0219609, relmipgap = 1.25205e-05 3 flow-cover cuts 3 Gomory cuts 1 implied-bound cut 2 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 = 3.79 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1162 59567 MIP simplex iterations 1412 branch-and-bound nodes 13 flow-cover cuts 3 Gomory cuts 20 implied-bound cuts 7 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 490 20012 MIP simplex iterations 542 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 14 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 = 3.59 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2145 51584 MIP simplex iterations 2552 branch-and-bound nodes 2 Gomory cuts 2 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=10 m=10 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.65 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2076 32306 MIP simplex iterations 1120 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 9 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 = 4.47 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2652 72959 MIP simplex iterations 3177 branch-and-bound nodes absmipgap = 0.11654, relmipgap = 4.39442e-05 1 flow-cover cut 3 Gomory cuts 6 implied-bound cuts 4 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 = 3.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2782 53852 MIP simplex iterations 2376 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts 5 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 = 3.39 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1994 43782 MIP simplex iterations 1458 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 1 implied-bound cut 13 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 = 3.6 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2619 47136 MIP simplex iterations 2057 branch-and-bound nodes absmipgap = 0.208644, relmipgap = 7.96657e-05 3 Gomory cuts 4 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 = 3.35 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2593 52248 MIP simplex iterations 2482 branch-and-bound nodes 2 flow-cover cuts 3 Gomory cuts 2 implied-bound cuts 2 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.01 Solve = 1.77 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2855 17941 MIP simplex iterations 805 branch-and-bound nodes absmipgap = 4.09273e-12, relmipgap = 1.43353e-15 3 flow-cover cuts 4 Gomory cuts 1 mixed-integer rounding cut Solving problem with n=10 m=10 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 4.13 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2496 64901 MIP simplex iterations 2849 branch-and-bound nodes absmipgap = 0.215321, relmipgap = 8.62664e-05 3 Gomory cuts 3 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 = 3.21 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1626 43577 MIP simplex iterations 1523 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 9 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.01 Solve = 3.84 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3073 44062 MIP simplex iterations 2328 branch-and-bound nodes absmipgap = 0.107883, relmipgap = 3.51067e-05 1 Gomory cut 2 implied-bound cuts 2 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 = 2.81 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2219 35856 MIP simplex iterations 1313 branch-and-bound nodes absmipgap = 0.0268965, relmipgap = 1.2121e-05 2 flow-cover cuts 1 Gomory cut 8 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 8.48 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2707 104247 MIP simplex iterations 4567 branch-and-bound nodes 3 Gomory cuts 7 implied-bound cuts 7 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 = 3.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3483 42838 MIP simplex iterations 2166 branch-and-bound nodes 4 flow-cover cuts 2 Gomory cuts 3 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 6.41 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1685 99647 MIP simplex iterations 3811 branch-and-bound nodes 2 flow-cover cuts 6 implied-bound cuts 13 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 = 3.17 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2768 48885 MIP simplex iterations 2039 branch-and-bound nodes absmipgap = 0.120848, relmipgap = 4.36591e-05 1 Gomory cut 7 implied-bound cuts 4 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 = 3.11 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3019 51830 MIP simplex iterations 2671 branch-and-bound nodes 1 Gomory cut 2 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.01 Solve = 2.21 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3280 17565 MIP simplex iterations 745 branch-and-bound nodes 4 flow-cover cuts 3 Gomory cuts 1 mixed-integer rounding cut Solving problem with n=10 m=10 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2342 43895 MIP simplex iterations 1741 branch-and-bound nodes 4 Gomory cuts 4 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 Solve = 4.52 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1107 60642 MIP simplex iterations 1450 branch-and-bound nodes absmipgap = 0.0908145, relmipgap = 8.20366e-05 3 flow-cover cuts 1 Gomory cut 25 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 = 5.3 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3815 59383 MIP simplex iterations 3459 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 1 implied-bound cut 2 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.01 Solve = 0.84 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 904 14341 MIP simplex iterations 537 branch-and-bound nodes 6 Gomory cuts 12 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.73 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 927 13170 MIP simplex iterations 586 branch-and-bound nodes 3 Gomory cuts 17 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.01 Solve = 2.45 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1078 44013 MIP simplex iterations 2416 branch-and-bound nodes 2 Gomory cuts 12 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.01 Solve = 2.19 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 767 39095 MIP simplex iterations 3399 branch-and-bound nodes 5 Gomory cuts 6 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 = 1.67 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 650 24261 MIP simplex iterations 1232 branch-and-bound nodes absmipgap = 0.00300791, relmipgap = 4.62756e-06 3 Gomory cuts 22 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 = 1.55 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 492 17830 MIP simplex iterations 746 branch-and-bound nodes 6 Gomory cuts 26 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 = 1.52 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 409 20264 MIP simplex iterations 997 branch-and-bound nodes 2 Gomory cuts 12 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.32 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 953 48294 MIP simplex iterations 3315 branch-and-bound nodes absmipgap = 0.0354805, relmipgap = 3.72303e-05 3 Gomory cuts 12 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 Solve = 2.09 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 936 24686 MIP simplex iterations 1061 branch-and-bound nodes absmipgap = 0.0806603, relmipgap = 8.61755e-05 2 flow-cover cuts 3 Gomory cuts 11 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 = 1.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 703 15687 MIP simplex iterations 839 branch-and-bound nodes 1 flow-cover cut 5 Gomory cuts 13 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 = 5.26 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 145 122246 MIP simplex iterations 6845 branch-and-bound nodes 6 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 6.16 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 518 92601 MIP simplex iterations 3748 branch-and-bound nodes 2 flow-cover cuts 12 implied-bound cuts 82 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.01 Solve = 1.65 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 436 22128 MIP simplex iterations 949 branch-and-bound nodes absmipgap = 1.53477e-12, relmipgap = 3.52012e-15 6 Gomory cuts 17 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 = 5.47 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 214 99870 MIP simplex iterations 4685 branch-and-bound nodes 2 Gomory cuts 3 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 30.24 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 305 588242 MIP simplex iterations 31047 branch-and-bound nodes 6 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 15.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 162 258393 MIP simplex iterations 13200 branch-and-bound nodes 7 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 3.51 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 95 76921 MIP simplex iterations 3064 branch-and-bound nodes 1 Gomory cut 2 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 23.98 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 640 364856 MIP simplex iterations 17858 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut 4 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 15.52 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 546 219672 MIP simplex iterations 8542 branch-and-bound nodes 1 Gomory cut 7 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 = 16.32 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 335 339956 MIP simplex iterations 24065 branch-and-bound nodes absmipgap = 0.0314752, relmipgap = 9.39559e-05 3 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.43 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1069 34716 MIP simplex iterations 2441 branch-and-bound nodes 5 Gomory cuts 12 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 = 1.23 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1180 15945 MIP simplex iterations 830 branch-and-bound nodes 4 Gomory cuts 13 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.38 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1469 106397 MIP simplex iterations 6828 branch-and-bound nodes absmipgap = 0.112426, relmipgap = 7.65322e-05 1 flow-cover cut 5 Gomory cuts 14 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 3.23 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 941 50798 MIP simplex iterations 2460 branch-and-bound nodes absmipgap = 0.00652134, relmipgap = 6.93022e-06 1 flow-cover cut 3 Gomory cuts 14 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.45 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1046 66035 MIP simplex iterations 3413 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts 25 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.56 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 673 17962 MIP simplex iterations 669 branch-and-bound nodes 2 Gomory cuts 31 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 2.31 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 957 36411 MIP simplex iterations 2312 branch-and-bound nodes 1 flow-cover cut 5 Gomory cuts 5 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.73 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 968 61761 MIP simplex iterations 3356 branch-and-bound nodes absmipgap = 0.00155658, relmipgap = 1.60804e-06 2 Gomory cuts 27 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.5 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1648 40442 MIP simplex iterations 2078 branch-and-bound nodes 1 flow-cover cut 5 Gomory cuts 1 implied-bound cut 15 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.43 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 862 58871 MIP simplex iterations 3831 branch-and-bound nodes absmipgap = 0.013469, relmipgap = 1.56253e-05 1 Gomory cut 8 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.33 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 218 104615 MIP simplex iterations 4389 branch-and-bound nodes 1 Gomory cut 14 implied-bound cuts 9 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.14 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1390 55580 MIP simplex iterations 4036 branch-and-bound nodes absmipgap = 0.04506, relmipgap = 3.24173e-05 2 flow-cover cuts 1 Gomory cut 8 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.68 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 871 78759 MIP simplex iterations 4014 branch-and-bound nodes absmipgap = 0.0719899, relmipgap = 8.2652e-05 1 flow-cover cut 4 Gomory cuts 28 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 57.57 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 490 930898 MIP simplex iterations 40127 branch-and-bound nodes absmipgap = 0.0109654, relmipgap = 2.23784e-05 5 flow-cover cuts 4 Gomory cuts 15 implied-bound cuts 15 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 65.78 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 870 913837 MIP simplex iterations 27326 branch-and-bound nodes absmipgap = 0.0100167, relmipgap = 1.15135e-05 1 flow-cover cut 26 implied-bound cuts 74 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 7.5 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 569 109301 MIP simplex iterations 3805 branch-and-bound nodes 20 flow-cover cuts 2 Gomory cuts 51 implied-bound cuts 31 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 78.76 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 743 1279475 MIP simplex iterations 61855 branch-and-bound nodes absmipgap = 0.065932, relmipgap = 8.87376e-05 8 flow-cover cuts 5 Gomory cuts 17 implied-bound cuts 18 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 63.53 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1365 1053088 MIP simplex iterations 42537 branch-and-bound nodes absmipgap = 0.0616719, relmipgap = 4.51808e-05 32 flow-cover cuts 6 Gomory cuts 55 implied-bound cuts 27 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.09 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1903 77356 MIP simplex iterations 4762 branch-and-bound nodes absmipgap = 0.0970133, relmipgap = 5.09791e-05 1 flow-cover cut 3 Gomory cuts 14 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 31.41 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 654 571055 MIP simplex iterations 19677 branch-and-bound nodes absmipgap = 0.0397223, relmipgap = 6.07375e-05 10 flow-cover cuts 4 Gomory cuts 5 implied-bound cuts 22 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 34.58 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 407 603324 MIP simplex iterations 13837 branch-and-bound nodes 1 flow-cover cut 10 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 27.71 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 803 452698 MIP simplex iterations 11581 branch-and-bound nodes absmipgap = 0.000104786, relmipgap = 1.30493e-07 1 flow-cover cut 1 Gomory cut 31 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 98.03 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1290 1566566 MIP simplex iterations 50611 branch-and-bound nodes absmipgap = 0.117094, relmipgap = 9.07706e-05 4 flow-cover cuts 3 Gomory cuts 18 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 52.9 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 872 931256 MIP simplex iterations 28299 branch-and-bound nodes absmipgap = 0.0078341, relmipgap = 8.98406e-06 4 Gomory cuts 5 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 986 36347 MIP simplex iterations 1489 branch-and-bound nodes 2 flow-cover cuts 4 Gomory cuts 1 mixed-integer rounding cut Solving problem with n=15 m=7 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 109.76 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1320 1948215 MIP simplex iterations 59998 branch-and-bound nodes absmipgap = 0.125898, relmipgap = 9.53769e-05 2 Gomory cuts 21 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 36.56 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1050 559393 MIP simplex iterations 17798 branch-and-bound nodes absmipgap = 0.0846799, relmipgap = 8.06476e-05 2 flow-cover cuts 3 Gomory cuts 9 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 37.9 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 460 643621 MIP simplex iterations 14895 branch-and-bound nodes absmipgap = 0.0104986, relmipgap = 2.28231e-05 4 flow-cover cuts 1 Gomory cut 39 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 19.43 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 769 297728 MIP simplex iterations 12037 branch-and-bound nodes 5 Gomory cuts 5 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 17.77 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1113 291975 MIP simplex iterations 11058 branch-and-bound nodes absmipgap = 0.0382552, relmipgap = 3.43712e-05 3 Gomory cuts 5 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 34.42 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 589 597431 MIP simplex iterations 16299 branch-and-bound nodes 8 flow-cover cuts 2 Gomory cuts 31 implied-bound cuts 8 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 24.09 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 829 259701 MIP simplex iterations 4994 branch-and-bound nodes absmipgap = 0.0281348, relmipgap = 3.39382e-05 7 flow-cover cuts 1 Gomory cut 6 implied-bound cuts 55 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 243.69 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1575 3796941 MIP simplex iterations 124072 branch-and-bound nodes absmipgap = 0.151217, relmipgap = 9.60107e-05 5 flow-cover cuts 3 Gomory cuts 33 implied-bound cuts 39 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 179.05 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 674 1957413 MIP simplex iterations 36768 branch-and-bound nodes absmipgap = 0.0242283, relmipgap = 3.5947e-05 5 flow-cover cuts 3 Gomory cuts 34 implied-bound cuts 34 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 12.57 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 349 171364 MIP simplex iterations 4576 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 5 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 442.36 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1080 7751397 MIP simplex iterations 187932 branch-and-bound nodes absmipgap = 0.0918826, relmipgap = 8.50765e-05 40 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 53.77 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 827 897726 MIP simplex iterations 24968 branch-and-bound nodes absmipgap = 0.00566472, relmipgap = 6.84972e-06 4 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 29.91 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 492 506483 MIP simplex iterations 11840 branch-and-bound nodes absmipgap = 0.0146471, relmipgap = 2.97705e-05 2 flow-cover cuts 6 Gomory cuts 18 implied-bound cuts 21 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 61.2 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 329 1086081 MIP simplex iterations 25268 branch-and-bound nodes Solving problem with n=15 m=7 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 70.81 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 947 1024983 MIP simplex iterations 21640 branch-and-bound nodes absmipgap = 0.0501091, relmipgap = 5.29135e-05 4 flow-cover cuts 15 implied-bound cuts 10 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 58.2 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1814 784023 MIP simplex iterations 35819 branch-and-bound nodes absmipgap = 0.174253, relmipgap = 9.60602e-05 5 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts 11 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 13.46 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1965 189731 MIP simplex iterations 7677 branch-and-bound nodes absmipgap = 0.185224, relmipgap = 9.42617e-05 3 Gomory cuts 3 implied-bound cuts 7 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 101.03 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3168 1613169 MIP simplex iterations 68085 branch-and-bound nodes absmipgap = 0.300283, relmipgap = 9.47863e-05 2 Gomory cuts 1 implied-bound cut 11 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 60.52 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2576 954761 MIP simplex iterations 40004 branch-and-bound nodes absmipgap = 0.232727, relmipgap = 9.03443e-05 3 Gomory cuts 2 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 10.5 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2000 143945 MIP simplex iterations 6593 branch-and-bound nodes absmipgap = 0.128191, relmipgap = 6.40953e-05 2 flow-cover cuts 2 Gomory cuts 21 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 178.12 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3157 3196740 MIP simplex iterations 94110 branch-and-bound nodes absmipgap = 0.308247, relmipgap = 9.76393e-05 1 Gomory cut 9 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 21.83 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2554 331948 MIP simplex iterations 11618 branch-and-bound nodes absmipgap = 0.237127, relmipgap = 9.28452e-05 2 flow-cover cuts 3 Gomory cuts 9 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 36.29 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1514 552032 MIP simplex iterations 19812 branch-and-bound nodes absmipgap = 0.121497, relmipgap = 8.02491e-05 2 Gomory cuts 21 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 24.74 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2025 382464 MIP simplex iterations 14994 branch-and-bound nodes absmipgap = 0.17328, relmipgap = 8.55703e-05 3 Gomory cuts 17 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 15.18 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2824 226418 MIP simplex iterations 7046 branch-and-bound nodes absmipgap = 0.228281, relmipgap = 8.08361e-05 1 flow-cover cut 3 Gomory cuts 11 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 261.89 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1892 4496981 MIP simplex iterations 127208 branch-and-bound nodes absmipgap = 0.18705, relmipgap = 9.88635e-05 13 flow-cover cuts 2 Gomory cuts 36 implied-bound cuts 9 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 68.61 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1923 1216604 MIP simplex iterations 28814 branch-and-bound nodes absmipgap = 0.0210029, relmipgap = 1.0922e-05 4 flow-cover cuts 24 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 64.27 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4080 1134837 MIP simplex iterations 57477 branch-and-bound nodes absmipgap = 0.376285, relmipgap = 9.22268e-05 2 Gomory cuts 1 mixed-integer rounding cut Solving problem with n=15 m=7 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 353.57 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2653 5787143 MIP simplex iterations 195918 branch-and-bound nodes absmipgap = 0.251371, relmipgap = 9.47499e-05 11 flow-cover cuts 1 Gomory cut 23 implied-bound cuts 15 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 35.23 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1865 550011 MIP simplex iterations 21267 branch-and-bound nodes absmipgap = 0.165476, relmipgap = 8.87271e-05 5 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 25 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 157.7 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3272 2592419 MIP simplex iterations 84628 branch-and-bound nodes absmipgap = 0.309598, relmipgap = 9.46203e-05 1 flow-cover cut 1 Gomory cut 2 implied-bound cuts 11 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 30.9 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3079 418002 MIP simplex iterations 15377 branch-and-bound nodes absmipgap = 0.243105, relmipgap = 7.8956e-05 4 Gomory cuts 1 mixed-integer rounding cut Solving problem with n=15 m=7 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 408.06 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1865 6963986 MIP simplex iterations 132672 branch-and-bound nodes absmipgap = 0.181628, relmipgap = 9.73874e-05 32 flow-cover cuts 5 Gomory cuts 21 implied-bound cuts 37 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 52 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1386 763709 MIP simplex iterations 29670 branch-and-bound nodes absmipgap = 0.101187, relmipgap = 7.30068e-05 2 flow-cover cuts 3 Gomory cuts 4 implied-bound cuts 12 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 40.21 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3347 695786 MIP simplex iterations 24369 branch-and-bound nodes absmipgap = 0.298027, relmipgap = 8.9043e-05 5 flow-cover cuts 1 Gomory cut 7 implied-bound cuts Solving problem with n=15 m=10 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 21.18 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 593 251182 MIP simplex iterations 4388 branch-and-bound nodes 1 flow-cover cut 48 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 593.39 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2086 9573352 MIP simplex iterations 264888 branch-and-bound nodes absmipgap = 0.20276, relmipgap = 9.72006e-05 5 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts 20 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 709.11 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2408 11120310 MIP simplex iterations 279927 branch-and-bound nodes absmipgap = 0.240225, relmipgap = 9.9761e-05 5 Gomory cuts 2 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 490.75 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1516 8173112 MIP simplex iterations 200260 branch-and-bound nodes absmipgap = 0.146522, relmipgap = 9.66502e-05 2 Gomory cuts 3 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 117.88 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1120 1843732 MIP simplex iterations 42271 branch-and-bound nodes absmipgap = 0.0842108, relmipgap = 7.51882e-05 4 Gomory cuts 1 mixed-integer rounding cut Solving problem with n=15 m=10 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 18.39 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1181 243346 MIP simplex iterations 8531 branch-and-bound nodes absmipgap = 0.117661, relmipgap = 9.96284e-05 3 Gomory cuts 17 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 62.73 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1266 975413 MIP simplex iterations 33072 branch-and-bound nodes absmipgap = 0.116517, relmipgap = 9.20355e-05 1 Gomory cut 11 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 139.86 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1867 2037911 MIP simplex iterations 46989 branch-and-bound nodes absmipgap = 0.146585, relmipgap = 7.85138e-05 4 Gomory cuts Solving problem with n=15 m=10 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 229.9 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2184 3624310 MIP simplex iterations 109099 branch-and-bound nodes absmipgap = 0.218317, relmipgap = 9.9962e-05 1 flow-cover cut 3 Gomory cuts 3 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 50.25 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1376 712300 MIP simplex iterations 17283 branch-and-bound nodes absmipgap = 0.133518, relmipgap = 9.70334e-05 2 Gomory cuts 35 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 46.06 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 801 791358 MIP simplex iterations 14984 branch-and-bound nodes absmipgap = 0.0519914, relmipgap = 6.49081e-05 20 flow-cover cuts 2 Gomory cuts 14 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 500.4 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1997 6052966 MIP simplex iterations 114004 branch-and-bound nodes absmipgap = 0.172661, relmipgap = 8.64603e-05 6 flow-cover cuts 2 Gomory cuts 10 implied-bound cuts 10 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 238.16 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2999 3787464 MIP simplex iterations 90915 branch-and-bound nodes absmipgap = 0.294031, relmipgap = 9.80431e-05 2 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 3 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 637.87 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2089 10921680 MIP simplex iterations 193675 branch-and-bound nodes absmipgap = 0.198669, relmipgap = 9.51023e-05 3 Gomory cuts 2 implied-bound cuts 24 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 49.55 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1153 683202 MIP simplex iterations 8838 branch-and-bound nodes absmipgap = 0.0682861, relmipgap = 5.92247e-05 2 flow-cover cuts 2 Gomory cuts 10 implied-bound cuts 5 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 24.74 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 259 326326 MIP simplex iterations 4819 branch-and-bound nodes 5 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 27.31 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 629 364872 MIP simplex iterations 6969 branch-and-bound nodes absmipgap = 0.0222478, relmipgap = 3.53702e-05 Solving problem with n=15 m=10 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 725.81 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2367 11909887 MIP simplex iterations 291203 branch-and-bound nodes absmipgap = 0.227645, relmipgap = 9.61744e-05 7 flow-cover cuts 2 Gomory cuts 9 implied-bound cuts 10 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 110.21 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2796 1553388 MIP simplex iterations 41943 branch-and-bound nodes absmipgap = 0.266232, relmipgap = 9.52189e-05 1 flow-cover cut 1 Gomory cut 11 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 104.5 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1979 1437567 MIP simplex iterations 52172 branch-and-bound nodes absmipgap = 0.172422, relmipgap = 8.71258e-05 2 flow-cover cuts 2 Gomory cuts 14 implied-bound cuts 15 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 59.1 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2561 857774 MIP simplex iterations 23080 branch-and-bound nodes absmipgap = 0.254165, relmipgap = 9.92446e-05 2 flow-cover cuts 2 Gomory cuts 1 implied-bound cut Solving problem with n=15 m=10 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 273.12 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4058 3919092 MIP simplex iterations 105936 branch-and-bound nodes absmipgap = 0.402773, relmipgap = 9.92541e-05 6 Gomory cuts 2 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 494.06 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4564 8139252 MIP simplex iterations 197689 branch-and-bound nodes absmipgap = 0.455025, relmipgap = 9.96986e-05 2 flow-cover cuts 2 Gomory cuts 1 mixed-integer rounding cut Solving problem with n=15 m=10 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 293.5 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3866 5039063 MIP simplex iterations 162564 branch-and-bound nodes absmipgap = 0.385045, relmipgap = 9.95979e-05 2 Gomory cuts 3 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 63.84 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3323 887490 MIP simplex iterations 21823 branch-and-bound nodes absmipgap = 0.299324, relmipgap = 9.00766e-05 1 flow-cover cut 4 Gomory cuts 2 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 168.76 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2774 2566577 MIP simplex iterations 80311 branch-and-bound nodes absmipgap = 0.276139, relmipgap = 9.95454e-05 1 flow-cover cut 3 Gomory cuts 9 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 112.77 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3196 1626429 MIP simplex iterations 51098 branch-and-bound nodes absmipgap = 0.319564, relmipgap = 9.99887e-05 1 flow-cover cut 2 Gomory cuts 3 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 240.21 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4624 3863692 MIP simplex iterations 110800 branch-and-bound nodes absmipgap = 0.460251, relmipgap = 9.95352e-05 1 Gomory cut Solving problem with n=15 m=10 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 179.89 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4400 2655170 MIP simplex iterations 104323 branch-and-bound nodes absmipgap = 0.43666, relmipgap = 9.9241e-05 3 Gomory cuts Solving problem with n=15 m=10 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 41.88 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3969 608875 MIP simplex iterations 26277 branch-and-bound nodes absmipgap = 0.353171, relmipgap = 8.89824e-05 2 flow-cover cuts 6 Gomory cuts 2 implied-bound cuts 5 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 878.59 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2531 14483946 MIP simplex iterations 228152 branch-and-bound nodes absmipgap = 0.249168, relmipgap = 9.84465e-05 35 flow-cover cuts 6 implied-bound cuts 36 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 366.25 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4101 5995835 MIP simplex iterations 177849 branch-and-bound nodes absmipgap = 0.405345, relmipgap = 9.88406e-05 2 flow-cover cuts 1 mixed-integer rounding cut Solving problem with n=15 m=10 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 335.28 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5327 5443637 MIP simplex iterations 134290 branch-and-bound nodes absmipgap = 0.52973, relmipgap = 9.94426e-05 1 Gomory cut 3 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 200.83 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4891 3530102 MIP simplex iterations 116546 branch-and-bound nodes absmipgap = 0.488521, relmipgap = 9.98815e-05 3 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 457.75 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2953 7484450 MIP simplex iterations 169833 branch-and-bound nodes absmipgap = 0.290507, relmipgap = 9.8377e-05 7 flow-cover cuts 17 implied-bound cuts 11 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 237.25 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2073 3576951 MIP simplex iterations 80800 branch-and-bound nodes absmipgap = 0.202516, relmipgap = 9.76921e-05 1 flow-cover cut 22 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 164.89 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2293 2374940 MIP simplex iterations 56613 branch-and-bound nodes absmipgap = 0.217206, relmipgap = 9.47257e-05 9 flow-cover cuts 10 implied-bound cuts 21 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 254.84 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5462 4184274 MIP simplex iterations 111380 branch-and-bound nodes absmipgap = 0.520743, relmipgap = 9.53393e-05 1 Gomory cut 2 implied-bound cuts Solving problem with n=15 m=10 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 94.92 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5746 1275932 MIP simplex iterations 68770 branch-and-bound nodes absmipgap = 0.571965, relmipgap = 9.95415e-05 5 Gomory cuts 2 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 27.13 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5382 380325 MIP simplex iterations 17643 branch-and-bound nodes absmipgap = 0.50057, relmipgap = 9.30082e-05 5 Gomory cuts 2 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.42 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1758 17701 MIP simplex iterations 832 branch-and-bound nodes absmipgap = 0.0302828, relmipgap = 1.72257e-05 1 flow-cover cut 3 Gomory cuts 6 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 6.5 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1611 109241 MIP simplex iterations 3956 branch-and-bound nodes absmipgap = 0.105317, relmipgap = 6.53736e-05 1 Gomory cut 34 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 8.62 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1077 115608 MIP simplex iterations 8050 branch-and-bound nodes absmipgap = 0.106233, relmipgap = 9.86376e-05 4 Gomory cuts 6 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 19.76 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 678 406085 MIP simplex iterations 26259 branch-and-bound nodes absmipgap = 0.0183015, relmipgap = 2.69933e-05 5 Gomory cuts 10 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.34 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1306 40390 MIP simplex iterations 2290 branch-and-bound nodes absmipgap = 0.0838789, relmipgap = 6.42258e-05 2 flow-cover cuts 6 Gomory cuts 16 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.33 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1325 30064 MIP simplex iterations 1201 branch-and-bound nodes absmipgap = 0.0266947, relmipgap = 2.01469e-05 7 Gomory cuts 12 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 146.39 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 811 1505531 MIP simplex iterations 90355 branch-and-bound nodes absmipgap = 0.0806341, relmipgap = 9.94255e-05 2 flow-cover cuts 2 Gomory cuts 10 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 3.5 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2395 62830 MIP simplex iterations 4513 branch-and-bound nodes 3 Gomory cuts 9 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.23 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1696 32418 MIP simplex iterations 986 branch-and-bound nodes absmipgap = 0.0335793, relmipgap = 1.97991e-05 1 flow-cover cut 5 Gomory cuts 12 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.06 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2229 34029 MIP simplex iterations 1750 branch-and-bound nodes absmipgap = 0.131766, relmipgap = 5.91146e-05 9 Gomory cuts 12 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 312.68 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 685 5019188 MIP simplex iterations 195493 branch-and-bound nodes absmipgap = 0.0679612, relmipgap = 9.92134e-05 3 flow-cover cuts 5 Gomory cuts 4 implied-bound cuts 15 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 172.5 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1014 2865192 MIP simplex iterations 111458 branch-and-bound nodes absmipgap = 0.0976118, relmipgap = 9.62641e-05 2 Gomory cuts 57 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 264.1 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 295 4883580 MIP simplex iterations 162009 branch-and-bound nodes 8 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 49.03 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 226 947893 MIP simplex iterations 28191 branch-and-bound nodes 9 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 90.81 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 449 1313449 MIP simplex iterations 61911 branch-and-bound nodes absmipgap = 0.0162184, relmipgap = 3.61212e-05 1 flow-cover cut Solving problem with n=20 m=3 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1238.73 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 629 25588416 MIP simplex iterations 1020781 branch-and-bound nodes absmipgap = 0.0609979, relmipgap = 9.6976e-05 1 flow-cover cut Solving problem with n=20 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 830.31 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 540 16268781 MIP simplex iterations 442256 branch-and-bound nodes absmipgap = 0.0508475, relmipgap = 9.4162e-05 11 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 9.09 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 848 142048 MIP simplex iterations 7484 branch-and-bound nodes 4 flow-cover cuts 7 Gomory cuts 5 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 62.72 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 444 1297336 MIP simplex iterations 55195 branch-and-bound nodes 6 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 54.22 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 999 612822 MIP simplex iterations 23717 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts 29 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 71.8 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2507 493084 MIP simplex iterations 32142 branch-and-bound nodes absmipgap = 0.241326, relmipgap = 9.62608e-05 5 Gomory cuts 8 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 21.04 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2423 373222 MIP simplex iterations 23913 branch-and-bound nodes absmipgap = 0.219566, relmipgap = 9.06176e-05 5 Gomory cuts 17 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 15.49 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1437 237438 MIP simplex iterations 13822 branch-and-bound nodes absmipgap = 0.0071403, relmipgap = 4.96889e-06 6 Gomory cuts 25 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 19.54 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1909 330394 MIP simplex iterations 17592 branch-and-bound nodes absmipgap = 0.171208, relmipgap = 8.96844e-05 5 Gomory cuts 5 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 55.78 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1648 837640 MIP simplex iterations 52873 branch-and-bound nodes absmipgap = 0.162866, relmipgap = 9.88267e-05 1 flow-cover cut 3 Gomory cuts 13 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.49 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1510 46174 MIP simplex iterations 2202 branch-and-bound nodes 3 flow-cover cuts 5 Gomory cuts 4 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 33.77 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1868 620351 MIP simplex iterations 39451 branch-and-bound nodes absmipgap = 0.172085, relmipgap = 9.21227e-05 6 Gomory cuts 1 mixed-integer rounding cut Solving problem with n=20 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 8.81 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2529 107416 MIP simplex iterations 6068 branch-and-bound nodes absmipgap = 0.251261, relmipgap = 9.93519e-05 13 Gomory cuts 9 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.98 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2037 52780 MIP simplex iterations 2190 branch-and-bound nodes absmipgap = 0.0520873, relmipgap = 2.55706e-05 4 Gomory cuts 22 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 10.46 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2528 83989 MIP simplex iterations 6898 branch-and-bound nodes absmipgap = 0.218077, relmipgap = 8.62645e-05 1 flow-cover cut 7 Gomory cuts 12 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1205.36 Output = 0.03 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2685 16308136 MIP simplex iterations 1050637 branch-and-bound nodes absmipgap = 0.266349, relmipgap = 9.9199e-05 2 flow-cover cuts 7 Gomory cuts 21 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 91.23 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2601 908482 MIP simplex iterations 66656 branch-and-bound nodes absmipgap = 0.249287, relmipgap = 9.58428e-05 2 flow-cover cuts 5 Gomory cuts 6 implied-bound cuts 10 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 423.19 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 880 6734302 MIP simplex iterations 195574 branch-and-bound nodes absmipgap = 0.0878828, relmipgap = 9.98668e-05 24 flow-cover cuts 3 Gomory cuts 58 implied-bound cuts 36 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 56.76 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1819 717048 MIP simplex iterations 61374 branch-and-bound nodes absmipgap = 0.180357, relmipgap = 9.91518e-05 1 flow-cover cut 6 Gomory cuts 6 implied-bound cuts 7 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 130.02 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 628 1947461 MIP simplex iterations 71305 branch-and-bound nodes absmipgap = 0.0470034, relmipgap = 7.48463e-05 9 flow-cover cuts 20 implied-bound cuts 16 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 38.32 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 679 589641 MIP simplex iterations 25211 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut 34 implied-bound cuts 4 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 65.55 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1961 607950 MIP simplex iterations 40986 branch-and-bound nodes absmipgap = 0.163702, relmipgap = 8.34789e-05 4 flow-cover cuts 7 Gomory cuts 4 implied-bound cuts 12 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 31.68 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2257 425149 MIP simplex iterations 23988 branch-and-bound nodes absmipgap = 0.197969, relmipgap = 8.77133e-05 7 flow-cover cuts 12 Gomory cuts 13 implied-bound cuts 29 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 73.1 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 980 1256556 MIP simplex iterations 39650 branch-and-bound nodes absmipgap = 0.0683062, relmipgap = 6.97002e-05 4 flow-cover cuts 2 Gomory cuts 9 implied-bound cuts 23 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 32.35 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2592 418968 MIP simplex iterations 21174 branch-and-bound nodes absmipgap = 0.230688, relmipgap = 8.89998e-05 8 flow-cover cuts 9 Gomory cuts 11 implied-bound cuts 30 mixed-integer rounding cuts