===================== USING MODEL: mzb1 ===================== Solving problem with n=5 m=3 scen=1 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 131 80 MIP simplex iterations 4 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 253 228 MIP simplex iterations 38 branch-and-bound nodes 4 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 165 38 MIP simplex iterations 0 branch-and-bound nodes absmipgap = 0.00891947, relmipgap = 5.40574e-05 1 flow-cover cut 1 Gomory cut 1 implied-bound cut Solving problem with n=5 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 256 153 MIP simplex iterations 13 branch-and-bound nodes 7 flow-cover cuts 1 Gomory cut Solving problem with n=5 m=3 scen=1 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 211 148 MIP simplex iterations 18 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut Solving problem with n=5 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 136 57 MIP simplex iterations 5 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 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 155 72 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=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 300 133 MIP simplex iterations 11 branch-and-bound nodes 4 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 83 73 MIP simplex iterations 4 branch-and-bound nodes absmipgap = 2.27374e-13, relmipgap = 2.73944e-15 6 flow-cover cuts 1 Gomory cut Solving problem with n=5 m=3 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 110 46 MIP simplex iterations 1 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.01 Solve = 0.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 43 163 MIP simplex iterations 9 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut Solving problem with n=5 m=3 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 183 265 MIP simplex iterations 35 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 2 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 86 59 MIP simplex iterations 3 branch-and-bound nodes 3 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts 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 217 338 MIP simplex iterations 33 branch-and-bound nodes 10 flow-cover cuts 2 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.18 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 242 295 MIP simplex iterations 51 branch-and-bound nodes 6 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 107 128 MIP simplex iterations 8 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts Solving problem with n=5 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 192 106 MIP simplex iterations 10 branch-and-bound nodes 3 flow-cover cuts 2 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 251 171 MIP simplex iterations 20 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=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 79 189 MIP simplex iterations 14 branch-and-bound nodes 5 flow-cover cuts 1 Gomory cut 1 implied-bound cut Solving problem with n=5 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.11 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 86 168 MIP simplex iterations 12 branch-and-bound nodes 4 flow-cover cuts 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 210 73 MIP simplex iterations 4 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut Solving problem with n=5 m=3 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 378 140 MIP simplex iterations 13 branch-and-bound nodes 4 flow-cover cuts 3 Gomory cuts Solving problem with n=5 m=3 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 298 117 MIP simplex iterations 14 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=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 446 256 MIP simplex iterations 19 branch-and-bound nodes 9 flow-cover cuts 1 Gomory cut 1 implied-bound cut Solving problem with n=5 m=3 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 244 215 MIP simplex iterations 19 branch-and-bound nodes 5 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 268 46 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=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 442 133 MIP simplex iterations 20 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut Solving problem with n=5 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.3 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 457 200 MIP simplex iterations 22 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 295 182 MIP simplex iterations 16 branch-and-bound nodes 5 flow-cover cuts 2 Gomory 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 301 158 MIP simplex iterations 21 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts Solving problem with n=5 m=3 scen=4 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 108 83 MIP simplex iterations 6 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts Solving problem with n=5 m=3 scen=4 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 292 159 MIP simplex iterations 15 branch-and-bound nodes 7 flow-cover cuts 1 Gomory cut 1 implied-bound cut Solving problem with n=5 m=3 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 257 131 MIP simplex iterations 17 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut 3 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 394 308 MIP simplex iterations 25 branch-and-bound nodes 8 flow-cover cuts 3 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 309 242 MIP simplex iterations 37 branch-and-bound nodes 7 flow-cover cuts 3 Gomory cuts 4 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.04 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 408 100 MIP simplex iterations 20 branch-and-bound nodes 5 flow-cover cuts 1 Gomory cut 1 implied-bound cut 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.01 CPLEX 12.1.0: optimal integer solution; objective 480 108 MIP simplex iterations 14 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 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.01 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 417 125 MIP simplex iterations 14 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 5 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 143 175 MIP simplex iterations 9 branch-and-bound nodes 9 flow-cover cuts 2 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 249 181 MIP simplex iterations 21 branch-and-bound nodes 5 flow-cover cuts 2 Gomory cuts 5 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.22 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 555 1829 MIP simplex iterations 109 branch-and-bound nodes 4 flow-cover cuts 4 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.84 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 960 12238 MIP simplex iterations 976 branch-and-bound nodes absmipgap = 3.52429e-12, relmipgap = 3.67114e-15 4 flow-cover cuts 2 Gomory cuts 21 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.07 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 594 14727 MIP simplex iterations 822 branch-and-bound nodes absmipgap = 0.0177588, relmipgap = 2.9897e-05 3 flow-cover cuts 6 Gomory cuts 21 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.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 703 4186 MIP simplex iterations 406 branch-and-bound nodes 4 flow-cover cuts 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 733 7949 MIP simplex iterations 677 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts Solving problem with n=10 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.54 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 884 8005 MIP simplex iterations 635 branch-and-bound nodes 4 flow-cover cuts 3 Gomory cuts 15 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.78 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 712 11003 MIP simplex iterations 840 branch-and-bound nodes 2 flow-cover cuts 7 Gomory cuts 12 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.21 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 819 1495 MIP simplex iterations 129 branch-and-bound nodes 6 flow-cover cuts 1 Gomory cut Solving problem with n=10 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.54 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 828 7836 MIP simplex iterations 694 branch-and-bound nodes 4 Gomory cuts 18 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.21 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 599 4219 MIP simplex iterations 406 branch-and-bound nodes 4 flow-cover cuts 3 Gomory cuts Solving problem with n=10 m=3 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.36 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 274 10172 MIP simplex iterations 597 branch-and-bound nodes 5 flow-cover cuts 1 Gomory cut 2 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.51 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 612 9045 MIP simplex iterations 534 branch-and-bound nodes absmipgap = 4.54747e-13, relmipgap = 7.43051e-16 3 Gomory cuts 28 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.01 Solve = 1.91 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 555 31463 MIP simplex iterations 1346 branch-and-bound nodes absmipgap = 2.27374e-13, relmipgap = 4.09682e-16 14 flow-cover cuts 2 implied-bound cuts 73 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.75 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 383 11143 MIP simplex iterations 606 branch-and-bound nodes 3 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts 35 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 598 16827 MIP simplex iterations 951 branch-and-bound nodes 1 flow-cover cut 7 Gomory cuts 22 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.92 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 584 9653 MIP simplex iterations 760 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts 22 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.15 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 163 3904 MIP simplex iterations 251 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.76 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 394 10310 MIP simplex iterations 565 branch-and-bound nodes 3 flow-cover cuts 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 = 0.53 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 477 8660 MIP simplex iterations 579 branch-and-bound nodes 4 Gomory cuts 23 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 201 18831 MIP simplex iterations 778 branch-and-bound nodes 3 flow-cover cuts 2 Gomory cuts 1 implied-bound cut 19 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.01 Solve = 1.04 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 865 10973 MIP simplex iterations 822 branch-and-bound nodes 4 Gomory cuts 20 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 = 1.29 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 986 15454 MIP simplex iterations 1002 branch-and-bound nodes absmipgap = 2.27374e-13, relmipgap = 2.30602e-16 4 flow-cover cuts 5 Gomory cuts 27 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1134 30081 MIP simplex iterations 1489 branch-and-bound nodes 13 flow-cover cuts 3 Gomory cuts 3 implied-bound cuts 47 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.71 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 916 11926 MIP simplex iterations 765 branch-and-bound nodes 3 flow-cover cuts 5 Gomory cuts 1 implied-bound cut 29 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.9 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1094 14363 MIP simplex iterations 902 branch-and-bound nodes absmipgap = 1.81899e-12, relmipgap = 1.6627e-15 2 flow-cover cuts 7 Gomory cuts 20 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 = 1.15 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 896 7943 MIP simplex iterations 647 branch-and-bound nodes 2 flow-cover cuts 5 Gomory cuts 15 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 868 17316 MIP simplex iterations 1173 branch-and-bound nodes 5 Gomory cuts 12 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.27 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 819 1346 MIP simplex iterations 134 branch-and-bound nodes 5 flow-cover cuts 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.59 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 875 10153 MIP simplex iterations 733 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts 18 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.74 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 752 11501 MIP simplex iterations 751 branch-and-bound nodes 5 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 = 1.22 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 822 13599 MIP simplex iterations 885 branch-and-bound nodes 6 flow-cover cuts 5 Gomory cuts 2 implied-bound cuts 29 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.63 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 619 11138 MIP simplex iterations 632 branch-and-bound nodes 9 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts 37 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.3 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1166 23724 MIP simplex iterations 1270 branch-and-bound nodes 15 flow-cover cuts 2 Gomory cuts 5 implied-bound cuts 37 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.32 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 786 25015 MIP simplex iterations 1115 branch-and-bound nodes 11 flow-cover cuts 1 Gomory cut 5 implied-bound cuts 37 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 Solve = 1.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1401 9768 MIP simplex iterations 663 branch-and-bound nodes absmipgap = 3.63798e-12, relmipgap = 2.5967e-15 2 flow-cover cuts 6 Gomory cuts 21 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.58 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 586 8592 MIP simplex iterations 676 branch-and-bound nodes 2 flow-cover cuts 4 Gomory cuts 19 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.36 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 542 26117 MIP simplex iterations 1354 branch-and-bound nodes 8 flow-cover cuts 3 Gomory cuts 2 implied-bound cuts 45 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.36 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 422 12459 MIP simplex iterations 632 branch-and-bound nodes 6 flow-cover cuts 3 Gomory cuts Solving problem with n=10 m=3 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.77 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 475 9414 MIP simplex iterations 601 branch-and-bound nodes 3 flow-cover cuts 4 Gomory cuts 15 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.47 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 516 28174 MIP simplex iterations 1300 branch-and-bound nodes 7 flow-cover cuts 3 Gomory cuts 7 implied-bound cuts 56 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 = 2.46 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 913 37182 MIP simplex iterations 1435 branch-and-bound nodes 1 Gomory cut 49 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 = 2.4 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 995 27592 MIP simplex iterations 1247 branch-and-bound nodes 6 flow-cover cuts 3 Gomory cuts 3 implied-bound cuts 57 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 838 26439 MIP simplex iterations 897 branch-and-bound nodes absmipgap = 5.68434e-13, relmipgap = 6.78322e-16 7 flow-cover cuts 3 Gomory cuts 1 implied-bound cut 56 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.4 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1388 34541 MIP simplex iterations 1550 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 35 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.01 Solve = 1.85 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1102 27938 MIP simplex iterations 1107 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 35 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 = 1.15 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 696 15489 MIP simplex iterations 690 branch-and-bound nodes 5 Gomory cuts 34 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=7 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 1843 62350 MIP simplex iterations 2034 branch-and-bound nodes absmipgap = 0.0497345, relmipgap = 2.69856e-05 6 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 79 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.25 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 480 6157 MIP simplex iterations 301 branch-and-bound nodes 7 flow-cover cuts 2 Gomory cuts Solving problem with n=10 m=7 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.52 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1058 34060 MIP simplex iterations 1389 branch-and-bound nodes 2 Gomory cuts 48 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.41 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1152 32262 MIP simplex iterations 1262 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts 36 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.07 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1141 37328 MIP simplex iterations 1562 branch-and-bound nodes absmipgap = 2.27374e-13, relmipgap = 1.99276e-16 5 flow-cover cuts 2 Gomory cuts 3 implied-bound cuts 81 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 = 2.75 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1335 42848 MIP simplex iterations 2133 branch-and-bound nodes 5 flow-cover cuts 2 Gomory cuts 4 implied-bound cuts 54 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 = 5.33 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 987 92695 MIP simplex iterations 2677 branch-and-bound nodes 12 flow-cover cuts 4 implied-bound cuts 107 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.36 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1600 18667 MIP simplex iterations 974 branch-and-bound nodes 3 flow-cover cuts 6 Gomory cuts 19 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.61 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1023 37766 MIP simplex iterations 1557 branch-and-bound nodes 10 flow-cover cuts 8 Gomory cuts 1 implied-bound cut 70 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.44 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 240 19776 MIP simplex iterations 623 branch-and-bound nodes 1 flow-cover cut 41 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 = 3.42 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2403 56647 MIP simplex iterations 1866 branch-and-bound nodes 13 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 74 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.01 Solve = 0.76 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 231 19496 MIP simplex iterations 462 branch-and-bound nodes 19 flow-cover cuts 2 Gomory cuts 3 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.5 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 857 47167 MIP simplex iterations 1307 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 128 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.13 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1441 31857 MIP simplex iterations 1151 branch-and-bound nodes 12 flow-cover cuts 2 Gomory cuts 1 implied-bound cut 61 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 = 2.84 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1958 39548 MIP simplex iterations 1742 branch-and-bound nodes 7 flow-cover cuts 3 Gomory cuts 3 implied-bound cuts 86 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 = 2.27 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1968 33367 MIP simplex iterations 1459 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 3 implied-bound cuts 63 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 = 6.68 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2172 111353 MIP simplex iterations 3672 branch-and-bound nodes absmipgap = 0.189682, relmipgap = 8.73306e-05 9 flow-cover cuts 2 Gomory cuts 6 implied-bound cuts 108 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.01 Solve = 1.36 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2556 23665 MIP simplex iterations 1228 branch-and-bound nodes 1 flow-cover cut 5 Gomory cuts 22 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.99 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2099 47585 MIP simplex iterations 2036 branch-and-bound nodes absmipgap = 0.0749475, relmipgap = 3.57063e-05 9 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 81 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 3.32 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1030 50114 MIP simplex iterations 2073 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 39 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 = 3.23 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2734 50234 MIP simplex iterations 1940 branch-and-bound nodes 4 flow-cover cuts 3 Gomory cuts 44 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.59 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1377 23220 MIP simplex iterations 1059 branch-and-bound nodes absmipgap = 0.114052, relmipgap = 8.28266e-05 7 flow-cover cuts 3 Gomory cuts 2 implied-bound cuts 50 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.84 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2000 66572 MIP simplex iterations 2774 branch-and-bound nodes absmipgap = 0.125722, relmipgap = 6.2861e-05 8 flow-cover cuts 4 Gomory cuts 4 implied-bound cuts 103 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 = 5.06 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2416 73857 MIP simplex iterations 2736 branch-and-bound nodes absmipgap = 0.0640529, relmipgap = 2.6512e-05 18 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 103 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 = 2.23 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2415 40430 MIP simplex iterations 1731 branch-and-bound nodes 5 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 74 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.77 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2455 44634 MIP simplex iterations 2189 branch-and-bound nodes absmipgap = 0.0245917, relmipgap = 1.0017e-05 4 Gomory cuts 33 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 = 5.72 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2378 98194 MIP simplex iterations 3310 branch-and-bound nodes absmipgap = 0.196891, relmipgap = 8.27969e-05 5 flow-cover cuts 2 Gomory cuts 7 implied-bound cuts 98 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.44 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3193 21814 MIP simplex iterations 1112 branch-and-bound nodes absmipgap = 1.09139e-11, relmipgap = 3.41808e-15 1 flow-cover cut 3 Gomory cuts 25 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 = 2.61 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2327 35186 MIP simplex iterations 1552 branch-and-bound nodes 10 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 66 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.28 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 347 22385 MIP simplex iterations 648 branch-and-bound nodes 20 flow-cover cuts 2 implied-bound cuts 89 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 = 2.54 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3462 36956 MIP simplex iterations 1386 branch-and-bound nodes 7 flow-cover cuts 2 Gomory cuts 46 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.91 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1306 16833 MIP simplex iterations 800 branch-and-bound nodes absmipgap = 1.06866e-11, relmipgap = 8.18267e-15 1 flow-cover cut 2 Gomory cuts 36 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.4 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2039 52496 MIP simplex iterations 2279 branch-and-bound nodes 2 flow-cover cuts 3 Gomory cuts 45 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.91 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3002 46854 MIP simplex iterations 2026 branch-and-bound nodes absmipgap = 0.216502, relmipgap = 7.21193e-05 2 Gomory cuts 40 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.01 Solve = 3.08 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 792 41330 MIP simplex iterations 1013 branch-and-bound nodes absmipgap = 1.25056e-12, relmipgap = 1.57898e-15 7 flow-cover cuts 1 implied-bound cut 86 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 = 12.65 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1881 262667 MIP simplex iterations 8591 branch-and-bound nodes absmipgap = 0.160437, relmipgap = 8.52936e-05 6 flow-cover cuts 3 Gomory cuts 2 implied-bound cuts 69 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.6 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1255 52684 MIP simplex iterations 1928 branch-and-bound nodes 1 Gomory cut 39 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 = 4.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 956 70586 MIP simplex iterations 1832 branch-and-bound nodes 3 Gomory cuts 46 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.01 Solve = 11.53 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1861 247547 MIP simplex iterations 8981 branch-and-bound nodes absmipgap = 0.108312, relmipgap = 5.82008e-05 6 flow-cover cuts 1 Gomory cut 43 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 = 5.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1364 69950 MIP simplex iterations 2094 branch-and-bound nodes 2 Gomory cuts 46 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.23 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1686 35928 MIP simplex iterations 1054 branch-and-bound nodes absmipgap = 4.54747e-13, relmipgap = 2.6972e-16 12 flow-cover cuts 1 Gomory cut 1 implied-bound cut 94 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 = 4.48 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1148 61044 MIP simplex iterations 1904 branch-and-bound nodes absmipgap = 0.092315, relmipgap = 8.04137e-05 5 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 69 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 9.46 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1191 220028 MIP simplex iterations 6073 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 52 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 = 9.61 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1795 145825 MIP simplex iterations 4921 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 60 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 = 11.96 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1070 213359 MIP simplex iterations 3783 branch-and-bound nodes 39 flow-cover cuts 1 implied-bound cut 205 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 6.78 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1767 127036 MIP simplex iterations 3965 branch-and-bound nodes 16 flow-cover cuts 3 Gomory cuts 2 implied-bound cuts 58 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.88 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1944 53152 MIP simplex iterations 1949 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 38 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 6.65 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 679 115028 MIP simplex iterations 1825 branch-and-bound nodes 27 flow-cover cuts 2 implied-bound cuts 106 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 11.1 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1906 171036 MIP simplex iterations 4532 branch-and-bound nodes absmipgap = 0.139548, relmipgap = 7.3215e-05 12 flow-cover cuts 1 Gomory cut 1 implied-bound cut 81 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 = 4.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1610 82020 MIP simplex iterations 2847 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts 43 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 = 0.55 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1791 8962 MIP simplex iterations 342 branch-and-bound nodes 11 flow-cover cuts 3 Gomory cuts 1 implied-bound cut Solving problem with n=10 m=10 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.47 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1252 105017 MIP simplex iterations 2835 branch-and-bound nodes 5 flow-cover cuts 34 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 = 2.41 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 595 34057 MIP simplex iterations 1012 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 44 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 = 6.42 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2331 93579 MIP simplex iterations 2961 branch-and-bound nodes absmipgap = 0.116785, relmipgap = 5.0101e-05 7 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 99 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 3.47 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2117 42008 MIP simplex iterations 1102 branch-and-bound nodes 14 flow-cover cuts 2 Gomory cuts 1 implied-bound cut 73 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 = 8.27 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2884 154692 MIP simplex iterations 5128 branch-and-bound nodes absmipgap = 0.0372594, relmipgap = 1.29194e-05 12 flow-cover cuts 2 Gomory cuts 5 implied-bound cuts 69 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 3.63 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2855 48436 MIP simplex iterations 1628 branch-and-bound nodes 1 Gomory cut 39 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 = 6.54 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 2246 98702 MIP simplex iterations 2510 branch-and-bound nodes 11 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts 97 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.01 Solve = 6.33 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2832 100462 MIP simplex iterations 3058 branch-and-bound nodes absmipgap = 0.0183492, relmipgap = 6.47924e-06 13 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 104 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 = 10.05 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2870 182605 MIP simplex iterations 6056 branch-and-bound nodes absmipgap = 0.202911, relmipgap = 7.07008e-05 16 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 73 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.66 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2934 10745 MIP simplex iterations 446 branch-and-bound nodes absmipgap = 0.139609, relmipgap = 4.7583e-05 12 flow-cover cuts 2 Gomory cuts Solving problem with n=10 m=10 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 10.4 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2836 202214 MIP simplex iterations 6570 branch-and-bound nodes absmipgap = 0.135504, relmipgap = 4.77801e-05 6 flow-cover cuts 1 Gomory cut 5 implied-bound cuts 104 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.01 Solve = 3.5 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1728 44876 MIP simplex iterations 1404 branch-and-bound nodes 3 flow-cover cuts 2 Gomory cuts 47 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 = 5.76 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3246 88347 MIP simplex iterations 3227 branch-and-bound nodes absmipgap = 0.214035, relmipgap = 6.59381e-05 12 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts 122 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 = 4.15 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2271 58161 MIP simplex iterations 1807 branch-and-bound nodes absmipgap = 0.104788, relmipgap = 4.61416e-05 7 flow-cover cuts 2 Gomory cuts 45 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 = 7.5 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2919 141285 MIP simplex iterations 4966 branch-and-bound nodes absmipgap = 0.150488, relmipgap = 5.15548e-05 18 flow-cover cuts 5 Gomory cuts 3 implied-bound cuts 46 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.46 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3536 58718 MIP simplex iterations 2358 branch-and-bound nodes absmipgap = 1.81899e-12, relmipgap = 5.1442e-16 3 flow-cover cuts 1 Gomory cut 31 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.01 Solve = 5.83 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1907 95095 MIP simplex iterations 2507 branch-and-bound nodes 14 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts 99 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 = 6.77 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2967 102730 MIP simplex iterations 3010 branch-and-bound nodes 16 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 95 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 = 9.5 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3267 172843 MIP simplex iterations 6069 branch-and-bound nodes absmipgap = 0.18576, relmipgap = 5.68596e-05 15 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 90 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 = 0.55 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3359 9962 MIP simplex iterations 419 branch-and-bound nodes 8 flow-cover cuts 2 Gomory cuts Solving problem with n=10 m=10 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 8.38 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2726 157956 MIP simplex iterations 5635 branch-and-bound nodes absmipgap = 0.110051, relmipgap = 4.0371e-05 3 flow-cover cuts 3 implied-bound cuts 95 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 5.55 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1261 87741 MIP simplex iterations 1750 branch-and-bound nodes absmipgap = 0.105385, relmipgap = 8.35724e-05 8 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts 98 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 = 6.86 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3975 106376 MIP simplex iterations 4346 branch-and-bound nodes absmipgap = 0.00157859, relmipgap = 3.9713e-07 8 flow-cover cuts 3 Gomory cuts 1 implied-bound cut 108 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.4 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1312 34700 MIP simplex iterations 1462 branch-and-bound nodes absmipgap = 0.049919, relmipgap = 3.8048e-05 6 Gomory cuts 31 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 = 8.47 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1510 117162 MIP simplex iterations 5000 branch-and-bound nodes absmipgap = 0.07802, relmipgap = 5.16689e-05 1 flow-cover cut 5 Gomory cuts 49 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 = 10.76 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2084 229510 MIP simplex iterations 8741 branch-and-bound nodes absmipgap = 0.129712, relmipgap = 6.22421e-05 1 flow-cover cut 2 Gomory cuts 45 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.34 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1579 61301 MIP simplex iterations 3531 branch-and-bound nodes absmipgap = 0.0131595, relmipgap = 8.33404e-06 1 flow-cover cut 8 Gomory cuts 16 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.37 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1202 42059 MIP simplex iterations 1618 branch-and-bound nodes 3 Gomory cuts 31 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 = 3.46 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1392 52577 MIP simplex iterations 2213 branch-and-bound nodes 2 Gomory cuts 45 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.01 Solve = 5.63 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1501 138334 MIP simplex iterations 6898 branch-and-bound nodes 2 flow-cover cuts 9 Gomory cuts 16 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 = 7.93 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1501 194955 MIP simplex iterations 12084 branch-and-bound nodes 3 flow-cover cuts 4 Gomory cuts 8 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.68 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1627 53620 MIP simplex iterations 2189 branch-and-bound nodes 1 flow-cover cut 7 Gomory cuts 33 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 3.98 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1326 87031 MIP simplex iterations 3624 branch-and-bound nodes absmipgap = 0.0373475, relmipgap = 2.81656e-05 1 flow-cover cut 3 Gomory cuts 28 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.83 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 253 106662 MIP simplex iterations 4205 branch-and-bound nodes 1 flow-cover cut 13 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.01 Solve = 23.52 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 686 396469 MIP simplex iterations 9699 branch-and-bound nodes absmipgap = 0.0612424, relmipgap = 8.92746e-05 29 flow-cover cuts 1 implied-bound cut 174 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 9.87 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1175 131767 MIP simplex iterations 6265 branch-and-bound nodes absmipgap = 0.0225397, relmipgap = 1.91828e-05 2 flow-cover cuts 3 Gomory cuts 43 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 308 89231 MIP simplex iterations 3087 branch-and-bound nodes 16 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 = 28.28 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 465 559348 MIP simplex iterations 23568 branch-and-bound nodes 18 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 = 14.91 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 318 289168 MIP simplex iterations 10850 branch-and-bound nodes 8 flow-cover cuts 24 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 10.95 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 390 171179 MIP simplex iterations 7784 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 15 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 = 33.5 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 700 685198 MIP simplex iterations 26705 branch-and-bound nodes 2 flow-cover cuts 13 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.01 Solve = 13.94 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 907 263147 MIP simplex iterations 7721 branch-and-bound nodes 1 Gomory cut 62 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 20.18 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 392 455697 MIP simplex iterations 11890 branch-and-bound nodes 1 flow-cover cut 18 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.45 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1313 32622 MIP simplex iterations 1252 branch-and-bound nodes 3 Gomory cuts 46 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.16 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1755 100329 MIP simplex iterations 3920 branch-and-bound nodes 2 flow-cover cuts 6 Gomory cuts 42 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.01 Solve = 9.26 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2139 193720 MIP simplex iterations 9659 branch-and-bound nodes absmipgap = 0.153487, relmipgap = 7.17563e-05 1 flow-cover cut 2 Gomory cuts 46 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 7.03 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1752 182450 MIP simplex iterations 8353 branch-and-bound nodes absmipgap = 0.166872, relmipgap = 9.52464e-05 4 Gomory cuts 15 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 = 9.25 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1478 202360 MIP simplex iterations 7465 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 42 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 = 2.87 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1390 48383 MIP simplex iterations 1872 branch-and-bound nodes absmipgap = 0.125361, relmipgap = 9.0188e-05 2 Gomory cuts 44 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 = 40.87 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1772 709022 MIP simplex iterations 43905 branch-and-bound nodes absmipgap = 0.149658, relmipgap = 8.44569e-05 2 flow-cover cuts 5 Gomory cuts 29 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.01 Solve = 16.55 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1668 447355 MIP simplex iterations 25283 branch-and-bound nodes absmipgap = 0.164834, relmipgap = 9.88212e-05 1 flow-cover cut 3 Gomory cuts 14 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 = 4.41 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2088 65170 MIP simplex iterations 3052 branch-and-bound nodes 8 Gomory cuts 26 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.01 Solve = 3.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1327 58819 MIP simplex iterations 2145 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 31 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 = 12.5 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 358 292938 MIP simplex iterations 8549 branch-and-bound nodes 10 flow-cover cuts 1 implied-bound cut 39 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 = 127.87 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1949 2109292 MIP simplex iterations 88892 branch-and-bound nodes absmipgap = 0.193943, relmipgap = 9.95091e-05 6 flow-cover cuts 2 Gomory cuts 5 implied-bound cuts 111 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 = 9.11 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1252 180191 MIP simplex iterations 6529 branch-and-bound nodes 12 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 82 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 = 32.18 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 790 852690 MIP simplex iterations 32798 branch-and-bound nodes 5 flow-cover cuts 2 Gomory cuts 5 implied-bound cuts 24 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 = 55.76 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1021 1262984 MIP simplex iterations 40447 branch-and-bound nodes absmipgap = 0.0831173, relmipgap = 8.14077e-05 12 flow-cover cuts 3 Gomory cuts 2 implied-bound cuts 63 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 = 41.47 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 872 626460 MIP simplex iterations 12705 branch-and-bound nodes 7 flow-cover cuts 11 implied-bound cuts 195 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 = 232.95 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1306 3413269 MIP simplex iterations 133385 branch-and-bound nodes absmipgap = 0.12164, relmipgap = 9.31391e-05 19 flow-cover cuts 7 Gomory cuts 13 implied-bound cuts 87 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 135.43 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1585 2542364 MIP simplex iterations 72592 branch-and-bound nodes absmipgap = 0.157846, relmipgap = 9.95876e-05 41 flow-cover cuts 10 Gomory cuts 14 implied-bound cuts 71 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 = 10.47 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2297 205510 MIP simplex iterations 10401 branch-and-bound nodes absmipgap = 0.189791, relmipgap = 8.26255e-05 12 flow-cover cuts 2 Gomory cuts 4 implied-bound cuts 60 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 = 131.13 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 767 2484159 MIP simplex iterations 92933 branch-and-bound nodes absmipgap = 0.054864, relmipgap = 7.15306e-05 11 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 32 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 21.05 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1026 384642 MIP simplex iterations 11001 branch-and-bound nodes absmipgap = 0.0541694, relmipgap = 5.27967e-05 3 flow-cover cuts 2 Gomory cuts 63 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 55.15 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1317 1032999 MIP simplex iterations 32684 branch-and-bound nodes absmipgap = 0.0922739, relmipgap = 7.00637e-05 1 flow-cover cut 2 Gomory cuts 49 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.01 Solve = 173.57 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1798 3340246 MIP simplex iterations 109525 branch-and-bound nodes absmipgap = 0.154873, relmipgap = 8.61361e-05 4 flow-cover cuts 2 Gomory cuts 57 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 135.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1590 2918910 MIP simplex iterations 89763 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 46 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 = 23.72 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1917 417329 MIP simplex iterations 10883 branch-and-bound nodes absmipgap = 0.179995, relmipgap = 9.3894e-05 2 flow-cover cuts 2 Gomory cuts 62 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 105.19 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2264 2247751 MIP simplex iterations 49644 branch-and-bound nodes absmipgap = 0.203564, relmipgap = 8.99133e-05 2 Gomory cuts 66 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 = 203.84 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2031 4388037 MIP simplex iterations 110140 branch-and-bound nodes absmipgap = 0.202986, relmipgap = 9.9944e-05 68 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.01 Solve = 15.5 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1064 271130 MIP simplex iterations 7388 branch-and-bound nodes absmipgap = 0.0534435, relmipgap = 5.02288e-05 64 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 Solve = 6.37 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1818 95911 MIP simplex iterations 4004 branch-and-bound nodes absmipgap = 0.0285077, relmipgap = 1.56808e-05 2 flow-cover cuts 3 Gomory cuts 44 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 = 27.67 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1690 538395 MIP simplex iterations 15988 branch-and-bound nodes absmipgap = 0.10176, relmipgap = 6.02127e-05 9 flow-cover cuts 3 Gomory cuts 47 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.01 Solve = 41.39 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 632 736262 MIP simplex iterations 11309 branch-and-bound nodes absmipgap = 0.0242062, relmipgap = 3.8301e-05 1 flow-cover cut 24 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 193.39 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1076 2550378 MIP simplex iterations 22515 branch-and-bound nodes absmipgap = 0.0907092, relmipgap = 8.43023e-05 29 flow-cover cuts 3 implied-bound cuts 252 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 = 170.79 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1852 2823896 MIP simplex iterations 75503 branch-and-bound nodes absmipgap = 0.17746, relmipgap = 9.58206e-05 5 flow-cover cuts 1 Gomory cut 78 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 782.96 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 965 12313413 MIP simplex iterations 214741 branch-and-bound nodes absmipgap = 0.0729115, relmipgap = 7.55559e-05 34 flow-cover cuts 2 implied-bound cuts 98 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 = 44.9 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 761 869807 MIP simplex iterations 18069 branch-and-bound nodes absmipgap = 0.0631859, relmipgap = 8.30301e-05 23 flow-cover cuts 2 implied-bound cuts 78 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 Solve = 683.54 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1654 9852869 MIP simplex iterations 163481 branch-and-bound nodes absmipgap = 0.162177, relmipgap = 9.80513e-05 11 flow-cover cuts 2 implied-bound cuts 284 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 = 93.29 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1510 1726402 MIP simplex iterations 42753 branch-and-bound nodes absmipgap = 0.0128953, relmipgap = 8.53996e-06 1 flow-cover cut 56 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.01 Solve = 107.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 520 1827401 MIP simplex iterations 20972 branch-and-bound nodes 21 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 97 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 Solve = 33.43 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 561 663300 MIP simplex iterations 15121 branch-and-bound nodes 5 flow-cover cuts 32 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 284.26 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1150 3960539 MIP simplex iterations 80805 branch-and-bound nodes absmipgap = 0.0540623, relmipgap = 4.70107e-05 21 flow-cover cuts 2 implied-bound cuts 72 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 = 103.95 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2226 1493298 MIP simplex iterations 31892 branch-and-bound nodes absmipgap = 0.202409, relmipgap = 9.09295e-05 9 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 206 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 84.59 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2799 1254964 MIP simplex iterations 24935 branch-and-bound nodes absmipgap = 0.256721, relmipgap = 9.1719e-05 4 flow-cover cuts 2 Gomory cuts 6 implied-bound cuts 135 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 = 760.42 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3753 14130210 MIP simplex iterations 478807 branch-and-bound nodes absmipgap = 0.373846, relmipgap = 9.96127e-05 4 flow-cover cuts 1 Gomory cut 72 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 = 113.55 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2849 1868734 MIP simplex iterations 48573 branch-and-bound nodes absmipgap = 0.242326, relmipgap = 8.50565e-05 12 flow-cover cuts 2 Gomory cuts 1 implied-bound cut 90 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.01 Solve = 222.27 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2917 3601588 MIP simplex iterations 82824 branch-and-bound nodes absmipgap = 0.268946, relmipgap = 9.21994e-05 7 flow-cover cuts 1 implied-bound cut 159 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 Solve = 785.49 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3782 11854756 MIP simplex iterations 215568 branch-and-bound nodes absmipgap = 0.376546, relmipgap = 9.95626e-05 9 flow-cover cuts 1 Gomory cut 1 implied-bound cut 223 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 67.58 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3256 974160 MIP simplex iterations 22867 branch-and-bound nodes absmipgap = 0.302801, relmipgap = 9.29978e-05 1 flow-cover cut 1 Gomory cut 65 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 = 163.51 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2170 2513832 MIP simplex iterations 54155 branch-and-bound nodes absmipgap = 0.216964, relmipgap = 9.99835e-05 3 flow-cover cuts 2 Gomory cuts 1 implied-bound cut 148 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 = 69.4 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2840 1239895 MIP simplex iterations 34788 branch-and-bound nodes absmipgap = 0.283219, relmipgap = 9.97249e-05 1 flow-cover cut 6 Gomory cuts 52 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 257.56 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3563 5039116 MIP simplex iterations 129479 branch-and-bound nodes absmipgap = 0.355066, relmipgap = 9.96537e-05 7 flow-cover cuts 1 Gomory cut 69 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 = 490.37 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2099 7291741 MIP simplex iterations 138810 branch-and-bound nodes absmipgap = 0.209535, relmipgap = 9.98261e-05 12 flow-cover cuts 1 Gomory cut 11 implied-bound cuts 198 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 Solve = 117.81 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2610 1631454 MIP simplex iterations 29013 branch-and-bound nodes absmipgap = 0.260291, relmipgap = 9.97283e-05 6 flow-cover cuts 1 Gomory cut 7 implied-bound cuts 193 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 = 516.33 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4560 9020295 MIP simplex iterations 335550 branch-and-bound nodes absmipgap = 0.45409, relmipgap = 9.95811e-05 11 flow-cover cuts 3 Gomory cuts 5 implied-bound cuts 135 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 195.07 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2720 3504601 MIP simplex iterations 101975 branch-and-bound nodes absmipgap = 0.26749, relmipgap = 9.8342e-05 3 flow-cover cuts 3 Gomory cuts 52 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 178.91 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2479 2652566 MIP simplex iterations 53884 branch-and-bound nodes absmipgap = 0.222194, relmipgap = 8.96304e-05 16 flow-cover cuts 3 implied-bound cuts 165 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 = 372.98 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3817 6652980 MIP simplex iterations 165662 branch-and-bound nodes absmipgap = 0.380319, relmipgap = 9.96383e-05 6 flow-cover cuts 1 Gomory cut 92 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.01 Solve = 132.96 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3907 2465851 MIP simplex iterations 65324 branch-and-bound nodes absmipgap = 0.37159, relmipgap = 9.51087e-05 2 flow-cover cuts 1 Gomory cut 61 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1743.52 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2042 17713490 MIP simplex iterations 188408 branch-and-bound nodes absmipgap = 0.191855, relmipgap = 9.39547e-05 32 flow-cover cuts 4 implied-bound cuts 330 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 = 76.99 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2021 1190058 MIP simplex iterations 29037 branch-and-bound nodes absmipgap = 0.130422, relmipgap = 6.45334e-05 9 flow-cover cuts 2 Gomory cuts 5 implied-bound cuts 120 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 = 205.84 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3838 3209804 MIP simplex iterations 67068 branch-and-bound nodes absmipgap = 0.376589, relmipgap = 9.81211e-05 11 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 171 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 98.01 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 998 1171293 MIP simplex iterations 19767 branch-and-bound nodes 93 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 Solve = 1527.4 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2817 28225328 MIP simplex iterations 698305 branch-and-bound nodes absmipgap = 0.280765, relmipgap = 9.96679e-05 1 flow-cover cut 3 Gomory cuts 62 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 Solve = 711.04 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2836 12261348 MIP simplex iterations 226338 branch-and-bound nodes absmipgap = 0.281033, relmipgap = 9.90949e-05 2 flow-cover cuts 1 Gomory cut 71 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 = 437.68 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2259 8251319 MIP simplex iterations 197454 branch-and-bound nodes absmipgap = 0.206701, relmipgap = 9.15012e-05 1 Gomory cut 62 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 = 236.02 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2119 4171358 MIP simplex iterations 96257 branch-and-bound nodes absmipgap = 0.196773, relmipgap = 9.28611e-05 1 Gomory cut 69 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 105 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1818 2016594 MIP simplex iterations 51496 branch-and-bound nodes absmipgap = 0.177251, relmipgap = 9.74976e-05 2 flow-cover cuts 1 Gomory cut 52 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 = 538.5 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1905 9659165 MIP simplex iterations 205862 branch-and-bound nodes absmipgap = 0.190342, relmipgap = 9.99173e-05 2 Gomory cuts 73 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 924.55 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2664 15750111 MIP simplex iterations 339980 branch-and-bound nodes absmipgap = 0.259548, relmipgap = 9.74278e-05 1 flow-cover cut 1 Gomory cut 73 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 726.04 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2556 13325542 MIP simplex iterations 348222 branch-and-bound nodes absmipgap = 0.199615, relmipgap = 7.80966e-05 3 flow-cover cuts 2 Gomory cuts 62 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.01 Solve = 160.45 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1792 2702394 MIP simplex iterations 57488 branch-and-bound nodes absmipgap = 0.172848, relmipgap = 9.64555e-05 3 flow-cover cuts 91 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 147.39 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1068 2589515 MIP simplex iterations 25013 branch-and-bound nodes absmipgap = 0.105373, relmipgap = 9.86639e-05 25 flow-cover cuts 3 implied-bound cuts 122 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 = 719.62 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2452 10297617 MIP simplex iterations 179057 branch-and-bound nodes absmipgap = 0.235454, relmipgap = 9.60253e-05 31 flow-cover cuts 1 implied-bound cut 226 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 618.77 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3291 8272726 MIP simplex iterations 103198 branch-and-bound nodes absmipgap = 0.326444, relmipgap = 9.91928e-05 2 flow-cover cuts 3 Gomory cuts 1 implied-bound cut 182 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 = 321.51 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2398 4106614 MIP simplex iterations 41314 branch-and-bound nodes absmipgap = 0.169387, relmipgap = 7.0637e-05 16 flow-cover cuts 5 Gomory cuts 1 implied-bound cut 206 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 = 211.83 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1452 2884706 MIP simplex iterations 21609 branch-and-bound nodes 19 flow-cover cuts 3 implied-bound cuts 166 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 = 36.64 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 512 621509 MIP simplex iterations 7305 branch-and-bound nodes 3 flow-cover cuts 58 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 123.21 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 943 1552431 MIP simplex iterations 21664 branch-and-bound nodes absmipgap = 0.0211585, relmipgap = 2.24374e-05 8 flow-cover cuts 2 implied-bound cuts 88 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1047.13 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2885 15366957 MIP simplex iterations 253418 branch-and-bound nodes absmipgap = 0.285776, relmipgap = 9.90559e-05 8 flow-cover cuts 6 implied-bound cuts 166 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 = 54.85 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2858 871920 MIP simplex iterations 32474 branch-and-bound nodes absmipgap = 0.272922, relmipgap = 9.54941e-05 5 flow-cover cuts 3 Gomory cuts 37 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 = 110.82 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2194 1661788 MIP simplex iterations 51104 branch-and-bound nodes absmipgap = 0.213109, relmipgap = 9.71328e-05 6 flow-cover cuts 2 Gomory cuts 63 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 236 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3023 3049914 MIP simplex iterations 39415 branch-and-bound nodes absmipgap = 0.29053, relmipgap = 9.61066e-05 8 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 229 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1454.96 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4760 21623328 MIP simplex iterations 355909 branch-and-bound nodes absmipgap = 0.47541, relmipgap = 9.9876e-05 7 flow-cover cuts 1 Gomory cut 3 implied-bound cuts 170 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 = 2717.5 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5163 39532474 MIP simplex iterations 626237 branch-and-bound nodes absmipgap = 0.514809, relmipgap = 9.97113e-05 3 flow-cover cuts 2 Gomory cuts 4 implied-bound cuts 203 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 843.6 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4544 13848836 MIP simplex iterations 283119 branch-and-bound nodes absmipgap = 0.452534, relmipgap = 9.95893e-05 3 Gomory cuts 92 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 = 684 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4151 9198940 MIP simplex iterations 139806 branch-and-bound nodes absmipgap = 0.414543, relmipgap = 9.98658e-05 14 flow-cover cuts 3 implied-bound cuts 231 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.01 Solve = 532.27 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3303 8703363 MIP simplex iterations 202329 branch-and-bound nodes absmipgap = 0.316617, relmipgap = 9.58573e-05 3 flow-cover cuts 1 Gomory cut 75 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 = 879.81 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3770 11737960 MIP simplex iterations 172727 branch-and-bound nodes absmipgap = 0.376363, relmipgap = 9.98311e-05 5 flow-cover cuts 2 implied-bound cuts 222 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1957.81 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5303 29579516 MIP simplex iterations 511026 branch-and-bound nodes absmipgap = 0.528883, relmipgap = 9.97327e-05 4 flow-cover cuts 3 Gomory cuts 9 implied-bound cuts 147 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 404.93 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4602 6182921 MIP simplex iterations 188706 branch-and-bound nodes absmipgap = 0.455376, relmipgap = 9.89517e-05 14 flow-cover cuts 3 Gomory cuts 4 implied-bound cuts 117 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 59.15 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4331 881751 MIP simplex iterations 24048 branch-and-bound nodes absmipgap = 0.431549, relmipgap = 9.96419e-05 8 flow-cover cuts 3 Gomory cuts 50 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 Solve = 3096.09 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2823 26939001 MIP simplex iterations 213068 branch-and-bound nodes absmipgap = 0.27869, relmipgap = 9.87213e-05 18 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 521 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1012.47 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4774 15553711 MIP simplex iterations 326629 branch-and-bound nodes absmipgap = 0.477269, relmipgap = 9.99725e-05 13 flow-cover cuts 3 Gomory cuts 4 implied-bound cuts 134 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 2822.88 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5912 41972025 MIP simplex iterations 673673 branch-and-bound nodes absmipgap = 0.590983, relmipgap = 9.99633e-05 4 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 203 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.01 Solve = 394.32 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5438 6268905 MIP simplex iterations 123962 branch-and-bound nodes absmipgap = 0.540101, relmipgap = 9.93198e-05 3 flow-cover cuts 2 Gomory cuts 81 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1032.42 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3838 15258229 MIP simplex iterations 248603 branch-and-bound nodes absmipgap = 0.381485, relmipgap = 9.93969e-05 4 flow-cover cuts 3 implied-bound cuts 195 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 = 629.73 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2622 10496838 MIP simplex iterations 248016 branch-and-bound nodes absmipgap = 0.257208, relmipgap = 9.80961e-05 2 flow-cover cuts 2 Gomory cuts 81 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 = 362.03 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3001 4733720 MIP simplex iterations 76906 branch-and-bound nodes absmipgap = 0.276112, relmipgap = 9.20065e-05 6 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 182 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.01 Solve = 933.53 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 6087 13971582 MIP simplex iterations 256813 branch-and-bound nodes absmipgap = 0.597179, relmipgap = 9.81073e-05 4 flow-cover cuts 3 Gomory cuts 14 implied-bound cuts 120 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 285.23 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5880 4535663 MIP simplex iterations 163735 branch-and-bound nodes absmipgap = 0.587275, relmipgap = 9.98768e-05 8 flow-cover cuts 2 Gomory cuts 3 implied-bound cuts 84 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 = 60.71 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5743 844984 MIP simplex iterations 23463 branch-and-bound nodes absmipgap = 0.559536, relmipgap = 9.74293e-05 18 flow-cover cuts 4 Gomory cuts 2 implied-bound cuts 110 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 199.37 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2459 2278071 MIP simplex iterations 101924 branch-and-bound nodes absmipgap = 0.243157, relmipgap = 9.88843e-05 6 Gomory cuts 48 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 Solve = 133.71 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2611 2376434 MIP simplex iterations 82494 branch-and-bound nodes absmipgap = 0.237403, relmipgap = 9.09243e-05 6 Gomory cuts 4 implied-bound cuts 112 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 92.08 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2649 1750219 MIP simplex iterations 72401 branch-and-bound nodes absmipgap = 0.255491, relmipgap = 9.64479e-05 2 Gomory cuts 47 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 35.3 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2603 696740 MIP simplex iterations 36623 branch-and-bound nodes absmipgap = 0.236714, relmipgap = 9.09388e-05 3 flow-cover cuts 2 Gomory cuts 34 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 = 153.43 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3001 3646527 MIP simplex iterations 103496 branch-and-bound nodes absmipgap = 0.293648, relmipgap = 9.785e-05 2 Gomory cuts 60 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 = 48.25 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3184 803478 MIP simplex iterations 23945 branch-and-bound nodes absmipgap = 0.0607431, relmipgap = 1.90776e-05 1 flow-cover cut 1 Gomory cut 68 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 228.5 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2622 3697046 MIP simplex iterations 167131 branch-and-bound nodes absmipgap = 0.256239, relmipgap = 9.77266e-05 1 Gomory cut 40 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 30.37 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3044 727942 MIP simplex iterations 31374 branch-and-bound nodes absmipgap = 0.175542, relmipgap = 5.76683e-05 6 Gomory cuts 14 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.01 Solve = 22.9 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2780 484526 MIP simplex iterations 13223 branch-and-bound nodes absmipgap = 0.198866, relmipgap = 7.15345e-05 1 Gomory cut 53 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 = 64.27 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3193 1174508 MIP simplex iterations 61458 branch-and-bound nodes absmipgap = 0.31358, relmipgap = 9.82085e-05 4 Gomory cuts 33 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 = 555.73 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 918 8573681 MIP simplex iterations 341586 branch-and-bound nodes absmipgap = 0.0855342, relmipgap = 9.31746e-05 2 flow-cover cuts 24 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 = 1221.72 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1597 19844377 MIP simplex iterations 516205 branch-and-bound nodes absmipgap = 0.159044, relmipgap = 9.95895e-05 5 flow-cover cuts 3 Gomory cuts 8 implied-bound cuts 172 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 347.91 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 559 5960003 MIP simplex iterations 135472 branch-and-bound nodes absmipgap = 0.0394405, relmipgap = 7.05554e-05 17 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 = 226.92 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 545 4410886 MIP simplex iterations 99227 branch-and-bound nodes absmipgap = 0.0416577, relmipgap = 7.64361e-05 1 flow-cover cut 1 Gomory cut 15 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 = 1365.42 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1064 24884106 MIP simplex iterations 1025175 branch-and-bound nodes absmipgap = 0.105211, relmipgap = 9.88824e-05 25 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 11.72 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1541 171907 MIP simplex iterations 6694 branch-and-bound nodes absmipgap = 0.132329, relmipgap = 8.58719e-05 1 flow-cover cut 4 Gomory cuts 43 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 765.45 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 777 11709959 MIP simplex iterations 453501 branch-and-bound nodes absmipgap = 0.0668916, relmipgap = 8.60896e-05 1 flow-cover cut 23 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 123.55 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1258 2334790 MIP simplex iterations 119939 branch-and-bound nodes absmipgap = 0.120665, relmipgap = 9.59182e-05 5 flow-cover cuts 3 Gomory cuts 4 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 72.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 988 1198559 MIP simplex iterations 26443 branch-and-bound nodes 1 flow-cover cut 72 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.01 Solve = 97.16 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1310 1811849 MIP simplex iterations 78813 branch-and-bound nodes absmipgap = 0.108587, relmipgap = 8.28912e-05 2 flow-cover cuts 4 Gomory cuts 41 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 = 240.68 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2976 4158149 MIP simplex iterations 165022 branch-and-bound nodes absmipgap = 0.280081, relmipgap = 9.41133e-05 2 Gomory cuts 63 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 Solve = 1192.42 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3335 20359376 MIP simplex iterations 649405 branch-and-bound nodes absmipgap = 0.33205, relmipgap = 9.95651e-05 2 flow-cover cuts 6 Gomory cuts 9 implied-bound cuts 95 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 = 184.38 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2786 3091261 MIP simplex iterations 122350 branch-and-bound nodes absmipgap = 0.27315, relmipgap = 9.80439e-05 3 Gomory cuts 55 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 63.4 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2781 653395 MIP simplex iterations 35569 branch-and-bound nodes absmipgap = 0.218082, relmipgap = 7.84186e-05 1 flow-cover cut 4 Gomory cuts 28 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 = 215.17 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3064 5459864 MIP simplex iterations 144212 branch-and-bound nodes absmipgap = 0.304107, relmipgap = 9.92517e-05 1 Gomory cut 65 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 54.05 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3181 883635 MIP simplex iterations 27885 branch-and-bound nodes absmipgap = 0.0920764, relmipgap = 2.89458e-05 2 Gomory cuts 60 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 = 634.14 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2887 11540861 MIP simplex iterations 501547 branch-and-bound nodes absmipgap = 0.288093, relmipgap = 9.97899e-05 2 flow-cover cuts 3 Gomory cuts 29 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 34.96 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3068 667251 MIP simplex iterations 30935 branch-and-bound nodes absmipgap = 0.286982, relmipgap = 9.35403e-05 1 flow-cover cut 5 Gomory cuts 12 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.01 Solve = 45.88 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2885 845113 MIP simplex iterations 31811 branch-and-bound nodes absmipgap = 0.285051, relmipgap = 9.88045e-05 3 Gomory cuts 55 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.01 Solve = 315.86 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3706 5403216 MIP simplex iterations 250552 branch-and-bound nodes absmipgap = 0.339713, relmipgap = 9.16656e-05 1 flow-cover cut 3 Gomory cuts 40 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 = 4558.37 Output = 0.03 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2981 74528472 MIP simplex iterations 3456586 branch-and-bound nodes absmipgap = 0.297593, relmipgap = 9.98298e-05 2 flow-cover cuts 5 Gomory cuts 59 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 = 3433.8 Output = 0.02 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3495 54696303 MIP simplex iterations 2148635 branch-and-bound nodes absmipgap = 0.348673, relmipgap = 9.97635e-05 6 flow-cover cuts 2 Gomory cuts 16 implied-bound cuts 138 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.01 Solve = 6054.38 Output = 0.02 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1390 46060139 MIP simplex iterations 629578 branch-and-bound nodes absmipgap = 0.133699, relmipgap = 9.61864e-05 31 flow-cover cuts 1 Gomory cut 7 implied-bound cuts 349 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 = 477.15 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2112 5917371 MIP simplex iterations 427950 branch-and-bound nodes absmipgap = 0.209424, relmipgap = 9.9159e-05 10 flow-cover cuts 10 Gomory cuts 2 implied-bound cuts 38 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 Solve = 3698.04 Output = 0.02 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1534 58275916 MIP simplex iterations 1668079 branch-and-bound nodes absmipgap = 0.152519, relmipgap = 9.9426e-05 16 flow-cover cuts 1 Gomory cut 12 implied-bound cuts 157 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 = 17.17 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1591 226825 MIP simplex iterations 8943 branch-and-bound nodes absmipgap = 0.0635046, relmipgap = 3.99149e-05 8 flow-cover cuts 4 Gomory cuts 2 implied-bound cuts 76 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 = 2072.1 Output = 0.02 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2677 27242847 MIP simplex iterations 1554243 branch-and-bound nodes absmipgap = 0.267264, relmipgap = 9.9837e-05 10 flow-cover cuts 6 Gomory cuts 14 implied-bound cuts 53 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 = 364.15 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2589 6017068 MIP simplex iterations 318629 branch-and-bound nodes absmipgap = 0.258802, relmipgap = 9.9962e-05 3 flow-cover cuts 6 Gomory cuts 14 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 = 539.57 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1637 9199764 MIP simplex iterations 269670 branch-and-bound nodes absmipgap = 0.160995, relmipgap = 9.83478e-05 2 flow-cover cuts 2 Gomory cuts 60 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 = 743.73 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3494 11941404 MIP simplex iterations 454714 branch-and-bound nodes absmipgap = 0.346707, relmipgap = 9.92293e-05 10 flow-cover cuts 2 Gomory cuts 8 implied-bound cuts 107 mixed-integer rounding cuts