===================== USING MODEL: mzb2 ===================== Solving problem with n=5 m=3 scen=1 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 131 121 MIP simplex iterations 2 branch-and-bound nodes absmipgap = 5.68434e-14, relmipgap = 4.33919e-16 1 flow-cover cut 2 Gomory cuts Solving problem with n=5 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 253 241 MIP simplex iterations 28 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 165 73 MIP simplex iterations 0 branch-and-bound nodes 1 Gomory cut 2 implied-bound cuts Solving problem with n=5 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.18 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 256 194 MIP simplex iterations 15 branch-and-bound nodes 4 flow-cover cuts 2 Gomory cuts 7 implied-bound cuts 2 mixed-integer rounding cuts Solving problem with n=5 m=3 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 211 181 MIP simplex iterations 17 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts Solving problem with n=5 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 136 135 MIP simplex iterations 3 branch-and-bound nodes 1 Gomory cut 1 implied-bound 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 67 MIP simplex iterations 0 branch-and-bound nodes Solving problem with n=5 m=3 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.11 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 300 124 MIP simplex iterations 5 branch-and-bound nodes 2 Gomory cuts 7 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=5 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 83 92 MIP simplex iterations 2 branch-and-bound nodes Solving problem with n=5 m=3 scen=1 seed=10 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 110 63 MIP simplex iterations 1 branch-and-bound nodes absmipgap = 0.0001, relmipgap = 9.09091e-07 Solving problem with n=5 m=3 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 43 94 MIP simplex iterations 5 branch-and-bound nodes 2 flow-cover cuts Solving problem with n=5 m=3 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 183 185 MIP simplex iterations 16 branch-and-bound nodes 1 Gomory cut 5 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 90 MIP simplex iterations 0 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 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.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 217 227 MIP simplex iterations 19 branch-and-bound nodes 1 Gomory cut 7 implied-bound cuts 2 mixed-integer rounding cuts Solving problem with n=5 m=3 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 242 241 MIP simplex iterations 38 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts 7 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 120 MIP simplex iterations 0 branch-and-bound nodes absmipgap = 8.52651e-14, relmipgap = 7.9687e-16 1 flow-cover cut 2 Gomory cuts 4 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.08 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 192 176 MIP simplex iterations 11 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts 6 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 251 117 MIP simplex iterations 8 branch-and-bound nodes 1 flow-cover cut 7 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 79 168 MIP simplex iterations 12 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut 4 implied-bound cuts Solving problem with n=5 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 86 167 MIP simplex iterations 11 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 7 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 210 89 MIP simplex iterations 8 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts Solving problem with n=5 m=3 scen=3 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 378 196 MIP simplex iterations 13 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 5 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 298 165 MIP simplex iterations 12 branch-and-bound nodes 4 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=5 m=3 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 446 351 MIP simplex iterations 36 branch-and-bound nodes 3 Gomory cuts 4 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=5 m=3 scen=3 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 244 188 MIP simplex iterations 13 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 4 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 268 98 MIP simplex iterations 4 branch-and-bound nodes 3 flow-cover cuts 2 Gomory cuts 3 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 442 138 MIP simplex iterations 18 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 2 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 457 121 MIP simplex iterations 8 branch-and-bound nodes 1 Gomory cut 4 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=5 m=3 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 295 170 MIP simplex iterations 14 branch-and-bound nodes 2 Gomory cuts 3 implied-bound cuts Solving problem with n=5 m=3 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 301 178 MIP simplex iterations 13 branch-and-bound nodes 2 flow-cover cuts 4 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.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 108 96 MIP simplex iterations 5 branch-and-bound nodes 2 flow-cover cuts 3 Gomory cuts 1 implied-bound cut 1 mixed-integer rounding cut Solving problem with n=5 m=3 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 292 158 MIP simplex iterations 7 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 4 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 257 147 MIP simplex iterations 12 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut 6 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=5 m=3 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 394 284 MIP simplex iterations 36 branch-and-bound nodes 2 Gomory cuts 5 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 309 229 MIP simplex iterations 27 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 7 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 408 151 MIP simplex iterations 13 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 5 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 480 127 MIP simplex iterations 13 branch-and-bound nodes 2 Gomory cuts 1 implied-bound cut Solving problem with n=5 m=3 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.02 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 417 164 MIP simplex iterations 8 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts 8 implied-bound cuts Solving problem with n=5 m=3 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 143 163 MIP simplex iterations 6 branch-and-bound nodes 1 flow-cover cut 8 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.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 249 238 MIP simplex iterations 17 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut 7 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.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 555 1334 MIP simplex iterations 66 branch-and-bound nodes 6 Gomory cuts Solving problem with n=10 m=3 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 0.81 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 960 15160 MIP simplex iterations 930 branch-and-bound nodes 2 flow-cover cuts 4 Gomory cuts 13 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.21 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 594 17110 MIP simplex iterations 867 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts 22 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.01 Solve = 1.33 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 703 10150 MIP simplex iterations 643 branch-and-bound nodes 4 Gomory cuts 8 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.84 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 733 9962 MIP simplex iterations 633 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 17 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.86 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 884 9714 MIP simplex iterations 653 branch-and-bound nodes 2 flow-cover cuts 5 Gomory cuts 8 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.37 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 712 14565 MIP simplex iterations 881 branch-and-bound nodes 7 Gomory cuts 2 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.08 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 819 2192 MIP simplex iterations 148 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts Solving problem with n=10 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.81 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 828 10296 MIP simplex iterations 663 branch-and-bound nodes 3 Gomory cuts 11 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 = 1.03 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 599 9539 MIP simplex iterations 569 branch-and-bound nodes 5 Gomory cuts 7 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.78 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 274 11466 MIP simplex iterations 590 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 17 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.74 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 612 11150 MIP simplex iterations 588 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 16 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 = 0.38 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 555 8212 MIP simplex iterations 415 branch-and-bound nodes 9 flow-cover cuts 2 Gomory cuts 34 implied-bound cuts 3 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 = 1.47 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 383 14553 MIP simplex iterations 633 branch-and-bound nodes 3 flow-cover cuts 3 Gomory cuts 4 implied-bound cuts 25 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 = 0.4 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 598 4108 MIP simplex iterations 188 branch-and-bound nodes 9 flow-cover cuts 3 Gomory cuts 7 implied-bound cuts Solving problem with n=10 m=3 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.73 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 584 12280 MIP simplex iterations 631 branch-and-bound nodes 2 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 Solve = 0.14 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 163 3487 MIP simplex iterations 168 branch-and-bound nodes 1 flow-cover cut Solving problem with n=10 m=3 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.4 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 394 14185 MIP simplex iterations 528 branch-and-bound nodes 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.77 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 477 10782 MIP simplex iterations 632 branch-and-bound nodes 3 Gomory cuts 18 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.8 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 201 11412 MIP simplex iterations 552 branch-and-bound nodes 3 flow-cover cuts 15 implied-bound cuts Solving problem with n=10 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.94 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 865 17670 MIP simplex iterations 937 branch-and-bound nodes 1 flow-cover cut 7 Gomory cuts 7 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.62 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 986 19016 MIP simplex iterations 1137 branch-and-bound nodes 5 flow-cover cuts 4 Gomory cuts 13 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.68 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1134 26992 MIP simplex iterations 1390 branch-and-bound nodes 2 flow-cover cuts 9 Gomory cuts 8 implied-bound cuts 6 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.93 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 916 12216 MIP simplex iterations 656 branch-and-bound nodes 3 flow-cover cuts 5 Gomory cuts 3 implied-bound cuts 15 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.01 Solve = 1.49 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1094 17852 MIP simplex iterations 921 branch-and-bound nodes absmipgap = 7.95808e-12, relmipgap = 7.27429e-15 5 Gomory cuts 14 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.79 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 896 10175 MIP simplex iterations 701 branch-and-bound nodes 1 flow-cover cut 5 Gomory cuts 5 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.36 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 868 20512 MIP simplex iterations 1063 branch-and-bound nodes 6 Gomory cuts 7 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.09 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 819 2004 MIP simplex iterations 147 branch-and-bound nodes 2 flow-cover cuts 2 Gomory cuts Solving problem with n=10 m=3 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 875 13869 MIP simplex iterations 854 branch-and-bound nodes 2 flow-cover cuts 5 Gomory cuts 9 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.88 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 752 13916 MIP simplex iterations 737 branch-and-bound nodes 5 Gomory cuts 17 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.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 822 22133 MIP simplex iterations 1123 branch-and-bound nodes 3 flow-cover cuts 5 Gomory cuts 3 implied-bound cuts 19 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.95 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 619 11533 MIP simplex iterations 573 branch-and-bound nodes 4 flow-cover cuts 5 Gomory cuts 5 implied-bound cuts 12 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.87 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1166 29808 MIP simplex iterations 1319 branch-and-bound nodes 12 flow-cover cuts 4 Gomory cuts 9 implied-bound cuts 8 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.01 Solve = 1.22 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 786 17758 MIP simplex iterations 699 branch-and-bound nodes 1 flow-cover cut 6 Gomory cuts 11 implied-bound cuts 15 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.41 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1401 16835 MIP simplex iterations 839 branch-and-bound nodes 3 flow-cover cuts 1 Gomory cut 18 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 = 1.16 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 586 10891 MIP simplex iterations 680 branch-and-bound nodes 3 Gomory cuts 9 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.55 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 542 27310 MIP simplex iterations 1274 branch-and-bound nodes 11 flow-cover cuts 3 Gomory cuts 10 implied-bound cuts 15 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.72 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 422 13361 MIP simplex iterations 576 branch-and-bound nodes 2 flow-cover cuts 5 Gomory cuts 2 implied-bound cuts 18 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.93 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 475 10389 MIP simplex iterations 668 branch-and-bound nodes 6 Gomory cuts 13 mixed-integer rounding cuts Solving problem with n=10 m=3 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.35 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 516 7185 MIP simplex iterations 338 branch-and-bound nodes 7 flow-cover cuts 37 implied-bound cuts Solving problem with n=10 m=7 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.75 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 913 31217 MIP simplex iterations 1527 branch-and-bound nodes absmipgap = 2.72848e-12, relmipgap = 2.98848e-15 1 Gomory cut 20 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.74 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 995 33486 MIP simplex iterations 1284 branch-and-bound nodes 5 Gomory cuts 12 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.57 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 838 33133 MIP simplex iterations 1043 branch-and-bound nodes 4 Gomory cuts 9 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.43 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1388 33167 MIP simplex iterations 1531 branch-and-bound nodes 3 Gomory cuts 5 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.3 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1102 28713 MIP simplex iterations 1269 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts 7 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.33 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 696 6238 MIP simplex iterations 306 branch-and-bound nodes 2 Gomory cuts Solving problem with n=10 m=7 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.26 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1843 71090 MIP simplex iterations 2675 branch-and-bound nodes 2 flow-cover cuts 3 Gomory cuts 5 implied-bound cuts 13 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.29 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 480 5449 MIP simplex iterations 272 branch-and-bound nodes 1 flow-cover cut 3 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.72 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1058 30902 MIP simplex iterations 1273 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 21 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.97 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1152 37811 MIP simplex iterations 1413 branch-and-bound nodes 2 flow-cover cuts 5 Gomory cuts 1 implied-bound cut 16 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 = 3.72 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1141 41039 MIP simplex iterations 2042 branch-and-bound nodes 3 flow-cover cuts 5 Gomory cuts 8 implied-bound cuts 23 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.85 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1335 38226 MIP simplex iterations 1575 branch-and-bound nodes 2 Gomory cuts 8 implied-bound cuts 9 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 = 4.46 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 987 51394 MIP simplex iterations 1525 branch-and-bound nodes absmipgap = 2.38742e-12, relmipgap = 2.41887e-15 5 flow-cover cuts 14 implied-bound cuts 39 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.96 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1600 16497 MIP simplex iterations 866 branch-and-bound nodes 5 Gomory cuts 2 implied-bound cuts 1 mixed-integer rounding cut Solving problem with n=10 m=7 scen=2 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 2.86 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1023 30665 MIP simplex iterations 1380 branch-and-bound nodes 2 flow-cover cuts 4 Gomory cuts 7 implied-bound cuts 6 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1.1 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 240 19175 MIP simplex iterations 651 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts Solving problem with n=10 m=7 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.11 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2403 44538 MIP simplex iterations 1722 branch-and-bound nodes absmipgap = 0.18548, relmipgap = 7.7187e-05 3 flow-cover cuts 1 Gomory cut 7 implied-bound cuts 15 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 0.76 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 231 14766 MIP simplex iterations 352 branch-and-bound nodes 1 flow-cover cut 32 implied-bound cuts Solving problem with n=10 m=7 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 2.62 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 857 32456 MIP simplex iterations 1098 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 12 implied-bound cuts 20 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 2.89 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1441 34625 MIP simplex iterations 1273 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 5 implied-bound cuts 12 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.73 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1958 28802 MIP simplex iterations 1549 branch-and-bound nodes absmipgap = 0.0207187, relmipgap = 1.05816e-05 4 implied-bound cuts 25 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.63 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1968 26071 MIP simplex iterations 1305 branch-and-bound nodes absmipgap = 0.0192247, relmipgap = 9.76862e-06 1 flow-cover cut 4 Gomory cuts 3 implied-bound cuts 9 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 = 10.31 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2172 114218 MIP simplex iterations 5032 branch-and-bound nodes absmipgap = 0.146961, relmipgap = 6.76617e-05 1 flow-cover cut 3 Gomory cuts 3 implied-bound cuts 33 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.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2556 23345 MIP simplex iterations 1007 branch-and-bound nodes 5 Gomory cuts 1 mixed-integer rounding cut Solving problem with n=10 m=7 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.32 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2099 59030 MIP simplex iterations 2880 branch-and-bound nodes absmipgap = 0.187789, relmipgap = 8.94658e-05 3 flow-cover cuts 2 Gomory cuts 3 implied-bound cuts 26 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.88 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1030 89546 MIP simplex iterations 4387 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 7 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.32 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2734 44943 MIP simplex iterations 1745 branch-and-bound nodes absmipgap = 0.223453, relmipgap = 8.17311e-05 4 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 12 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 = 2.36 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1377 27034 MIP simplex iterations 1348 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 3 implied-bound cuts 14 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 = 5.14 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2000 59441 MIP simplex iterations 3006 branch-and-bound nodes absmipgap = 0.038765, relmipgap = 1.93825e-05 5 Gomory cuts 4 implied-bound cuts 15 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 = 4.58 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2416 60139 MIP simplex iterations 2685 branch-and-bound nodes absmipgap = 0.202062, relmipgap = 8.36351e-05 1 flow-cover cut 3 Gomory cuts 5 implied-bound cuts 16 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.08 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 2415 31076 MIP simplex iterations 1239 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 21 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 = 3.45 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2455 38542 MIP simplex iterations 1992 branch-and-bound nodes 2 Gomory cuts 6 implied-bound cuts 11 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.69 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2378 81223 MIP simplex iterations 3313 branch-and-bound nodes absmipgap = 0.0367414, relmipgap = 1.54506e-05 1 Gomory cut 3 implied-bound cuts 30 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.47 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3193 23340 MIP simplex iterations 1028 branch-and-bound nodes absmipgap = 1.81899e-12, relmipgap = 5.6968e-16 6 Gomory cuts 2 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 = 3.13 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2327 34975 MIP simplex iterations 1677 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 14 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 = 3.24 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 347 39998 MIP simplex iterations 723 branch-and-bound nodes absmipgap = 9.19158e-11, relmipgap = 2.64887e-13 1 Gomory cut 11 implied-bound cuts 29 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 = 3.36 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3462 42654 MIP simplex iterations 1681 branch-and-bound nodes 4 flow-cover cuts 1 Gomory cut 13 mixed-integer rounding cuts Solving problem with n=10 m=7 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1.68 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1306 15827 MIP simplex iterations 747 branch-and-bound nodes absmipgap = 6.84395e-11, relmipgap = 5.24039e-14 1 flow-cover cut 3 Gomory cuts 2 implied-bound cuts 11 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 = 4.07 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2039 54082 MIP simplex iterations 2402 branch-and-bound nodes absmipgap = 8.6402e-12, relmipgap = 4.23747e-15 1 Gomory cut 18 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.01 Solve = 3.72 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3002 44591 MIP simplex iterations 1987 branch-and-bound nodes 1 Gomory cut 4 implied-bound cuts 8 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 = 4.88 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 792 63446 MIP simplex iterations 1734 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 6 implied-bound cuts 18 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 = 17.12 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1881 263090 MIP simplex iterations 9618 branch-and-bound nodes absmipgap = 0.0837431, relmipgap = 4.45205e-05 2 Gomory cuts 6 implied-bound cuts 14 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 = 5.73 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1255 58705 MIP simplex iterations 2265 branch-and-bound nodes 3 Gomory cuts 5 implied-bound cuts 13 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.01 Solve = 6.47 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 956 96177 MIP simplex iterations 2675 branch-and-bound nodes 5 Gomory cuts 7 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 13.52 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1861 190295 MIP simplex iterations 6857 branch-and-bound nodes absmipgap = 0.179658, relmipgap = 9.65385e-05 1 Gomory cut 24 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.15 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1364 52316 MIP simplex iterations 1567 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts 5 implied-bound cuts 13 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.76 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1686 39157 MIP simplex iterations 1228 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 17 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.09 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1148 49177 MIP simplex iterations 1445 branch-and-bound nodes absmipgap = 0.0344944, relmipgap = 3.00474e-05 2 flow-cover cuts 2 Gomory cuts 10 implied-bound cuts 22 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 = 8.05 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1191 123554 MIP simplex iterations 3240 branch-and-bound nodes 2 flow-cover cuts 4 Gomory cuts 1 implied-bound cut 5 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.95 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1795 125590 MIP simplex iterations 4523 branch-and-bound nodes absmipgap = 0.125612, relmipgap = 6.9979e-05 1 Gomory cut 1 implied-bound cut 20 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 7.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1070 90849 MIP simplex iterations 2138 branch-and-bound nodes 6 flow-cover cuts 2 Gomory cuts 11 implied-bound cuts 35 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 = 9.55 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1767 150496 MIP simplex iterations 4951 branch-and-bound nodes absmipgap = 0.00909091, relmipgap = 5.14483e-06 6 implied-bound cuts 15 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 = 11.42 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1944 189004 MIP simplex iterations 5754 branch-and-bound nodes 7 flow-cover cuts 5 Gomory cuts 14 implied-bound cuts 8 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 8.55 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 679 149057 MIP simplex iterations 2787 branch-and-bound nodes 21 implied-bound cuts 12 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 = 8.56 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1906 127610 MIP simplex iterations 4710 branch-and-bound nodes 2 Gomory cuts 5 implied-bound cuts 12 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.04 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1610 60674 MIP simplex iterations 1686 branch-and-bound nodes 4 flow-cover cuts 2 Gomory cuts 3 implied-bound cuts 17 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.32 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1791 21857 MIP simplex iterations 635 branch-and-bound nodes absmipgap = 1.13687e-12, relmipgap = 6.34767e-16 1 flow-cover cut 1 Gomory cut 1 implied-bound cut 10 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.4 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1252 70061 MIP simplex iterations 1430 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 20 implied-bound cuts 13 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.66 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 595 29890 MIP simplex iterations 751 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 33 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.01 Solve = 6.77 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2331 83159 MIP simplex iterations 3178 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 4 implied-bound cuts 11 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.44 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2117 32643 MIP simplex iterations 926 branch-and-bound nodes absmipgap = 1.72804e-11, relmipgap = 8.16268e-15 1 flow-cover cut 1 Gomory cut 2 implied-bound cuts 6 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 = 10.27 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2884 143841 MIP simplex iterations 5292 branch-and-bound nodes absmipgap = 0.0257264, relmipgap = 8.92039e-06 3 flow-cover cuts 1 Gomory cut 5 implied-bound cuts 13 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.1 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2855 51047 MIP simplex iterations 1963 branch-and-bound nodes 1 Gomory cut 10 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.97 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2246 90834 MIP simplex iterations 2688 branch-and-bound nodes absmipgap = 0.120549, relmipgap = 5.36729e-05 3 Gomory cuts 5 implied-bound cuts 4 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 6.72 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2832 73185 MIP simplex iterations 2775 branch-and-bound nodes absmipgap = 0.205122, relmipgap = 7.243e-05 1 flow-cover cut 1 Gomory cut 5 implied-bound cuts 22 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 = 11.06 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2870 156031 MIP simplex iterations 6359 branch-and-bound nodes absmipgap = 0.124667, relmipgap = 4.3438e-05 2 flow-cover cuts 1 Gomory cut 1 implied-bound cut 2 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.36 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2934 24280 MIP simplex iterations 827 branch-and-bound nodes 3 Gomory cuts 9 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 11.67 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2836 159865 MIP simplex iterations 6919 branch-and-bound nodes absmipgap = 0.204515, relmipgap = 7.21139e-05 3 Gomory cuts 4 implied-bound cuts 6 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 4.29 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1728 53439 MIP simplex iterations 1544 branch-and-bound nodes 2 Gomory cuts 16 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.75 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3246 70197 MIP simplex iterations 3132 branch-and-bound nodes absmipgap = 0.177717, relmipgap = 5.47495e-05 1 flow-cover cut 1 Gomory cut 2 implied-bound cuts 10 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.89 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2271 54642 MIP simplex iterations 1877 branch-and-bound nodes 1 flow-cover cut 2 Gomory cuts 5 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.77 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 2919 116465 MIP simplex iterations 3967 branch-and-bound nodes 3 Gomory cuts 14 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 5.64 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3536 56781 MIP simplex iterations 2491 branch-and-bound nodes absmipgap = 0.105317, relmipgap = 2.97841e-05 3 Gomory cuts 11 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 10.55 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1907 131533 MIP simplex iterations 3632 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 10 implied-bound cuts 16 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.22 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2967 66303 MIP simplex iterations 2162 branch-and-bound nodes 1 flow-cover cut 15 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 Solve = 9.49 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3267 134783 MIP simplex iterations 6056 branch-and-bound nodes absmipgap = 0.103957, relmipgap = 3.18204e-05 1 flow-cover cut 2 Gomory cuts 2 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.39 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 3359 19468 MIP simplex iterations 678 branch-and-bound nodes absmipgap = 2.72848e-12, relmipgap = 8.12291e-16 1 flow-cover cut 2 Gomory cuts 6 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 8.47 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2726 121515 MIP simplex iterations 5455 branch-and-bound nodes absmipgap = 0.256528, relmipgap = 9.41042e-05 1 flow-cover cut 11 implied-bound cuts 9 mixed-integer rounding cuts Solving problem with n=10 m=10 scen=4 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 6.01 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1261 75992 MIP simplex iterations 1785 branch-and-bound nodes 1 Gomory cut 7 implied-bound cuts 29 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.01 Solve = 8.32 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3975 100651 MIP simplex iterations 4789 branch-and-bound nodes absmipgap = 0.0758856, relmipgap = 1.90907e-05 3 Gomory cuts 2 implied-bound cuts 6 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 = 4.82 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1312 64445 MIP simplex iterations 3138 branch-and-bound nodes absmipgap = 0.0349407, relmipgap = 2.66316e-05 3 Gomory cuts 20 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 = 4.99 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1510 75061 MIP simplex iterations 3954 branch-and-bound nodes 1 flow-cover cut 3 Gomory cuts 27 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 7.8 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 2084 143708 MIP simplex iterations 5987 branch-and-bound nodes 4 Gomory cuts 28 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2.77 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1579 42276 MIP simplex iterations 2715 branch-and-bound nodes 1 flow-cover cut 5 Gomory cuts 4 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.95 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1202 37648 MIP simplex iterations 1131 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts 26 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.68 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1392 50014 MIP simplex iterations 1610 branch-and-bound nodes 5 Gomory cuts 30 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 6.42 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1501 144909 MIP simplex iterations 5719 branch-and-bound nodes absmipgap = 0.112299, relmipgap = 7.48161e-05 1 flow-cover cut 5 Gomory cuts 5 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 = 16.98 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1501 235303 MIP simplex iterations 14027 branch-and-bound nodes absmipgap = 0.144255, relmipgap = 9.61057e-05 5 Gomory cuts 13 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 = 3.55 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1627 50946 MIP simplex iterations 2746 branch-and-bound nodes 4 Gomory cuts 19 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=1 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 5.23 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1326 94096 MIP simplex iterations 2770 branch-and-bound nodes 3 Gomory cuts 30 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 = 9.93 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 253 127947 MIP simplex iterations 4176 branch-and-bound nodes 1 Gomory cut 5 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 = 18.64 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 686 283442 MIP simplex iterations 9982 branch-and-bound nodes absmipgap = 0.0556568, relmipgap = 8.11324e-05 2 flow-cover cuts 1 Gomory cut 15 implied-bound cuts 71 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 5.81 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1175 89134 MIP simplex iterations 4230 branch-and-bound nodes absmipgap = 0.0152534, relmipgap = 1.29816e-05 3 flow-cover cuts 5 Gomory cuts 32 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 = 12.95 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 308 198771 MIP simplex iterations 7349 branch-and-bound nodes 2 flow-cover cuts 7 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 = 63.78 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 465 986127 MIP simplex iterations 36532 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 11 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 15.17 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 318 271322 MIP simplex iterations 7934 branch-and-bound nodes 1 Gomory cut 11 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.46 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 390 158221 MIP simplex iterations 6910 branch-and-bound nodes absmipgap = 1.7053e-13, relmipgap = 4.37257e-16 2 Gomory cuts 4 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.01 Solve = 43.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 700 634399 MIP simplex iterations 23907 branch-and-bound nodes 3 flow-cover cuts 5 Gomory cuts 2 implied-bound cuts 14 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 11.88 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 907 201501 MIP simplex iterations 8395 branch-and-bound nodes 2 Gomory cuts 1 implied-bound cut 6 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 18.44 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 392 339458 MIP simplex iterations 8543 branch-and-bound nodes absmipgap = 0.0233391, relmipgap = 5.95386e-05 4 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.63 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1313 57853 MIP simplex iterations 2075 branch-and-bound nodes 4 Gomory cuts 16 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 = 6.6 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1755 101624 MIP simplex iterations 4826 branch-and-bound nodes absmipgap = 0.158155, relmipgap = 9.01166e-05 1 flow-cover cut 2 Gomory cuts 28 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 13.59 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2139 221877 MIP simplex iterations 12409 branch-and-bound nodes absmipgap = 0.151997, relmipgap = 7.10597e-05 1 flow-cover cut 5 Gomory cuts 33 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 = 9 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1752 188040 MIP simplex iterations 6305 branch-and-bound nodes absmipgap = 0.0352583, relmipgap = 2.01246e-05 10 Gomory cuts 4 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 = 6.3 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 1478 111423 MIP simplex iterations 4999 branch-and-bound nodes 3 Gomory cuts 23 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.01 Solve = 2.75 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 1390 42954 MIP simplex iterations 1510 branch-and-bound nodes 1 flow-cover cut 4 Gomory cuts 30 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 Solve = 26.96 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1772 465535 MIP simplex iterations 31027 branch-and-bound nodes absmipgap = 0.161932, relmipgap = 9.13836e-05 1 flow-cover cut 6 Gomory cuts 10 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 27.45 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1668 433385 MIP simplex iterations 23943 branch-and-bound nodes absmipgap = 0.141687, relmipgap = 8.49441e-05 1 flow-cover cut 4 Gomory cuts 15 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 = 5.47 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2088 96937 MIP simplex iterations 3270 branch-and-bound nodes absmipgap = 0.100869, relmipgap = 4.83089e-05 2 flow-cover cuts 8 Gomory cuts 13 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 3.42 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1327 44352 MIP simplex iterations 1787 branch-and-bound nodes absmipgap = 0.0284841, relmipgap = 2.1465e-05 1 Gomory cut 23 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 = 15.78 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 358 239697 MIP simplex iterations 8326 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 27 implied-bound cuts 6 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 = 122.66 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1949 1883719 MIP simplex iterations 101717 branch-and-bound nodes absmipgap = 0.166372, relmipgap = 8.53626e-05 6 flow-cover cuts 3 Gomory cuts 19 implied-bound cuts 41 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.01 Solve = 11.13 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1252 191762 MIP simplex iterations 7027 branch-and-bound nodes absmipgap = 0.0736514, relmipgap = 5.8827e-05 3 flow-cover cuts 3 Gomory cuts 5 implied-bound cuts 42 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 = 88.69 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 790 1296564 MIP simplex iterations 56487 branch-and-bound nodes absmipgap = 0.0643548, relmipgap = 8.14618e-05 1 flow-cover cut 2 Gomory cuts 22 implied-bound cuts 12 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 = 95.07 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1021 1524564 MIP simplex iterations 48534 branch-and-bound nodes absmipgap = 0.0401719, relmipgap = 3.93456e-05 5 flow-cover cuts 2 Gomory cuts 24 implied-bound cuts 49 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 25.4 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 872 387175 MIP simplex iterations 12045 branch-and-bound nodes absmipgap = 0.0377355, relmipgap = 4.32747e-05 18 flow-cover cuts 3 Gomory cuts 42 implied-bound cuts 55 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 = 102.01 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1306 1641446 MIP simplex iterations 76897 branch-and-bound nodes absmipgap = 0.128304, relmipgap = 9.82423e-05 14 flow-cover cuts 4 Gomory cuts 27 implied-bound cuts 2 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 = 230.92 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1585 3553371 MIP simplex iterations 118377 branch-and-bound nodes absmipgap = 0.101595, relmipgap = 6.4098e-05 26 flow-cover cuts 2 Gomory cuts 78 implied-bound cuts 22 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.01 Solve = 11.94 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2297 206547 MIP simplex iterations 12582 branch-and-bound nodes absmipgap = 0.078464, relmipgap = 3.41593e-05 5 flow-cover cuts 2 Gomory cuts 5 implied-bound cuts 16 mixed-integer rounding cuts Solving problem with n=15 m=3 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 40.61 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 767 532770 MIP simplex iterations 15339 branch-and-bound nodes 8 flow-cover cuts 3 Gomory cuts 30 implied-bound cuts 10 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 = 25.27 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1026 330103 MIP simplex iterations 9731 branch-and-bound nodes absmipgap = 0.0579873, relmipgap = 5.65178e-05 3 Gomory cuts 28 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 = 144.27 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1317 2100387 MIP simplex iterations 60570 branch-and-bound nodes absmipgap = 0.0834328, relmipgap = 6.33506e-05 2 Gomory cuts 27 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 209.43 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1798 3168056 MIP simplex iterations 104035 branch-and-bound nodes absmipgap = 0.170897, relmipgap = 9.50485e-05 2 flow-cover cuts 2 Gomory cuts 24 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 = 145.51 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1590 2368198 MIP simplex iterations 73811 branch-and-bound nodes absmipgap = 0.158088, relmipgap = 9.94266e-05 4 Gomory cuts 6 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.77 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1917 323330 MIP simplex iterations 8741 branch-and-bound nodes absmipgap = 0.181818, relmipgap = 9.48452e-05 2 Gomory cuts 17 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 114.6 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2264 1859562 MIP simplex iterations 44253 branch-and-bound nodes absmipgap = 0.205026, relmipgap = 9.05592e-05 4 Gomory cuts 25 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 = 295.86 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2031 4790512 MIP simplex iterations 134651 branch-and-bound nodes absmipgap = 0.19059, relmipgap = 9.38403e-05 2 Gomory cuts 26 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 = 29.67 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1064 403099 MIP simplex iterations 10978 branch-and-bound nodes absmipgap = 0.0879368, relmipgap = 8.26473e-05 1 flow-cover cut 3 Gomory cuts 26 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 11.21 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1818 144047 MIP simplex iterations 5647 branch-and-bound nodes absmipgap = 0.0909091, relmipgap = 5.0005e-05 2 flow-cover cuts 4 Gomory cuts 10 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 = 48.07 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1690 754570 MIP simplex iterations 23499 branch-and-bound nodes absmipgap = 0.144666, relmipgap = 8.56013e-05 4 Gomory cuts 19 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 17.81 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 632 216214 MIP simplex iterations 2698 branch-and-bound nodes 1 flow-cover cut 1 Gomory cut 19 implied-bound cuts 8 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 57.47 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1076 723953 MIP simplex iterations 10137 branch-and-bound nodes absmipgap = 0.0223074, relmipgap = 2.07318e-05 5 flow-cover cuts 13 implied-bound cuts 45 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 = 346.19 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1852 5093490 MIP simplex iterations 136065 branch-and-bound nodes absmipgap = 0.126355, relmipgap = 6.8226e-05 4 flow-cover cuts 1 Gomory cut 22 implied-bound cuts 37 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 462.56 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 965 6326319 MIP simplex iterations 119216 branch-and-bound nodes absmipgap = 0.0298506, relmipgap = 3.09333e-05 1 flow-cover cut 1 Gomory cut 39 implied-bound cuts 6 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 = 23.95 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 761 319631 MIP simplex iterations 6945 branch-and-bound nodes absmipgap = 0.0352582, relmipgap = 4.63314e-05 4 flow-cover cuts 1 Gomory cut 11 implied-bound cuts 38 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 = 1017.78 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1654 15802930 MIP simplex iterations 424526 branch-and-bound nodes absmipgap = 0.165353, relmipgap = 9.99718e-05 2 flow-cover cuts 10 implied-bound cuts 60 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 = 147.42 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1510 2179567 MIP simplex iterations 56923 branch-and-bound nodes absmipgap = 0.14771, relmipgap = 9.7821e-05 1 flow-cover cut 1 Gomory cut 7 implied-bound cuts 9 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=2 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 52.75 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 520 679031 MIP simplex iterations 12089 branch-and-bound nodes 2 flow-cover cuts 1 Gomory cut 33 implied-bound cuts 18 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 = 48.84 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 561 675826 MIP simplex iterations 13683 branch-and-bound nodes absmipgap = 0.0013006, relmipgap = 2.31836e-06 2 Gomory cuts 19 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.01 Solve = 114.53 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1150 1629363 MIP simplex iterations 31245 branch-and-bound nodes absmipgap = 0.000223055, relmipgap = 1.9396e-07 1 flow-cover cut 1 Gomory cut 26 implied-bound cuts 15 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 = 93.84 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2226 1317460 MIP simplex iterations 40280 branch-and-bound nodes absmipgap = 0.156946, relmipgap = 7.05058e-05 2 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 21 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 = 97.6 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2799 1248676 MIP simplex iterations 34754 branch-and-bound nodes absmipgap = 0.269159, relmipgap = 9.61625e-05 1 flow-cover cut 2 Gomory cuts 6 implied-bound cuts 28 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 = 788.93 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3753 11937786 MIP simplex iterations 472834 branch-and-bound nodes absmipgap = 0.372085, relmipgap = 9.91433e-05 2 flow-cover cuts 1 implied-bound cut 22 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 113.12 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2849 1566449 MIP simplex iterations 52434 branch-and-bound nodes absmipgap = 0.282507, relmipgap = 9.91602e-05 2 flow-cover cuts 3 Gomory cuts 5 implied-bound cuts 4 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 161.83 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2917 2173657 MIP simplex iterations 60212 branch-and-bound nodes absmipgap = 0.286995, relmipgap = 9.83869e-05 4 Gomory cuts 5 implied-bound cuts 38 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 = 632.61 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3782 9055035 MIP simplex iterations 220608 branch-and-bound nodes absmipgap = 0.365681, relmipgap = 9.669e-05 1 flow-cover cut 1 Gomory cut 4 implied-bound cuts 48 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 67.39 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3256 837733 MIP simplex iterations 22100 branch-and-bound nodes absmipgap = 0.304985, relmipgap = 9.36685e-05 1 flow-cover cut 2 Gomory cuts 6 implied-bound cuts 22 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 = 175.14 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2170 2424512 MIP simplex iterations 71790 branch-and-bound nodes absmipgap = 0.215479, relmipgap = 9.9299e-05 4 flow-cover cuts 2 Gomory cuts 2 implied-bound cuts 29 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 95.83 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2840 1420832 MIP simplex iterations 45068 branch-and-bound nodes absmipgap = 0.281175, relmipgap = 9.90053e-05 1 flow-cover cut 2 Gomory cuts 18 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 271.42 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3563 4198118 MIP simplex iterations 124560 branch-and-bound nodes absmipgap = 0.338969, relmipgap = 9.51358e-05 1 flow-cover cut 2 Gomory cuts 1 implied-bound cut 29 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 459.03 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2099 6327819 MIP simplex iterations 137675 branch-and-bound nodes absmipgap = 0.203668, relmipgap = 9.70309e-05 22 flow-cover cuts 2 Gomory cuts 21 implied-bound cuts 24 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=2 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 165.55 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2610 2421151 MIP simplex iterations 55573 branch-and-bound nodes absmipgap = 0.231707, relmipgap = 8.87767e-05 3 flow-cover cuts 37 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.01 Solve = 416.7 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4560 6410449 MIP simplex iterations 320137 branch-and-bound nodes absmipgap = 0.45549, relmipgap = 9.98881e-05 1 Gomory cut 14 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 138.32 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2720 2008915 MIP simplex iterations 55734 branch-and-bound nodes absmipgap = 0.109313, relmipgap = 4.01884e-05 4 flow-cover cuts 3 Gomory cuts 22 implied-bound cuts 12 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 = 136.95 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2479 1968753 MIP simplex iterations 53018 branch-and-bound nodes absmipgap = 0.242625, relmipgap = 9.78722e-05 5 flow-cover cuts 2 Gomory cuts 4 implied-bound cuts 25 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 408.77 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3817 5946348 MIP simplex iterations 165950 branch-and-bound nodes absmipgap = 0.363154, relmipgap = 9.51411e-05 38 mixed-integer rounding cuts Solving problem with n=15 m=7 scen=4 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 202.72 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3907 2960971 MIP simplex iterations 87472 branch-and-bound nodes absmipgap = 0.376274, relmipgap = 9.63076e-05 1 Gomory cut 19 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.01 Solve = 635.89 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2042 9169665 MIP simplex iterations 158730 branch-and-bound nodes absmipgap = 0.195839, relmipgap = 9.59055e-05 5 flow-cover cuts 5 Gomory cuts 14 implied-bound cuts 32 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 = 77.94 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2021 1070277 MIP simplex iterations 33044 branch-and-bound nodes absmipgap = 0.196466, relmipgap = 9.72124e-05 2 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 13 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 = 155.79 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3838 2396200 MIP simplex iterations 70966 branch-and-bound nodes absmipgap = 0.381569, relmipgap = 9.94187e-05 2 flow-cover cuts 1 Gomory cut 5 implied-bound cuts 15 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 56.06 Output = 0 CPLEX 12.1.0: optimal integer solution; objective 998 722631 MIP simplex iterations 12651 branch-and-bound nodes 2 Gomory cuts 45 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 = 3939.05 Output = 0.02 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2817 57166435 MIP simplex iterations 1478343 branch-and-bound nodes absmipgap = 0.281175, relmipgap = 9.98135e-05 1 flow-cover cut 1 Gomory cut 1 implied-bound cut 37 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 884.06 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2836 11708848 MIP simplex iterations 252452 branch-and-bound nodes absmipgap = 0.282937, relmipgap = 9.97663e-05 2 flow-cover cuts 4 Gomory cuts 13 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 = 649.43 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2259 9846267 MIP simplex iterations 247819 branch-and-bound nodes absmipgap = 0.221283, relmipgap = 9.79561e-05 1 Gomory cut 16 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 = 152.81 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2119 2037636 MIP simplex iterations 47187 branch-and-bound nodes absmipgap = 0.202433, relmipgap = 9.55325e-05 2 flow-cover cuts 2 Gomory cuts 3 implied-bound cuts 33 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 = 127.03 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1818 1827384 MIP simplex iterations 43819 branch-and-bound nodes absmipgap = 0.167444, relmipgap = 9.21034e-05 4 Gomory cuts 8 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 1168.66 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1905 17928157 MIP simplex iterations 428823 branch-and-bound nodes absmipgap = 0.190266, relmipgap = 9.98772e-05 2 Gomory cuts 20 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=1 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 903.11 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2664 12416958 MIP simplex iterations 294390 branch-and-bound nodes absmipgap = 0.262167, relmipgap = 9.8411e-05 2 Gomory cuts 29 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 = 538.01 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2556 7534730 MIP simplex iterations 220861 branch-and-bound nodes absmipgap = 0.25292, relmipgap = 9.89515e-05 4 Gomory cuts 8 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 = 240.27 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1792 3271828 MIP simplex iterations 70466 branch-and-bound nodes absmipgap = 0.175258, relmipgap = 9.78003e-05 2 flow-cover cuts 1 Gomory cut 34 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 407.46 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1068 6315488 MIP simplex iterations 131238 branch-and-bound nodes absmipgap = 0.10583, relmipgap = 9.90921e-05 4 flow-cover cuts 1 implied-bound cut 54 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 = 424.67 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2452 5812183 MIP simplex iterations 128094 branch-and-bound nodes absmipgap = 0.234507, relmipgap = 9.56392e-05 10 flow-cover cuts 2 Gomory cuts 14 implied-bound cuts 30 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 386.69 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3291 5231631 MIP simplex iterations 97964 branch-and-bound nodes absmipgap = 0.327337, relmipgap = 9.94643e-05 6 implied-bound cuts 13 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 = 863.36 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2398 11524279 MIP simplex iterations 182001 branch-and-bound nodes absmipgap = 0.216397, relmipgap = 9.02405e-05 1 flow-cover cut 3 Gomory cuts 1 implied-bound cut 45 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 = 135.55 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1452 1784503 MIP simplex iterations 21688 branch-and-bound nodes absmipgap = 0.125555, relmipgap = 8.64701e-05 8 flow-cover cuts 1 Gomory cut 15 implied-bound cuts 17 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 = 66.5 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 512 724807 MIP simplex iterations 9737 branch-and-bound nodes absmipgap = 0.0412085, relmipgap = 8.04854e-05 10 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 = 113.82 Output = 0.01 CPLEX 12.1.0: optimal integer solution; objective 943 1559608 MIP simplex iterations 21632 branch-and-bound nodes 2 flow-cover cuts 20 implied-bound cuts 10 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 = 1064.86 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2885 14605062 MIP simplex iterations 305542 branch-and-bound nodes absmipgap = 0.284441, relmipgap = 9.85932e-05 1 flow-cover cut 2 Gomory cuts 19 implied-bound cuts 10 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 133.97 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2858 1567132 MIP simplex iterations 36627 branch-and-bound nodes absmipgap = 0.256255, relmipgap = 8.96623e-05 1 flow-cover cut 2 Gomory cuts 28 implied-bound cuts 16 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 = 292.26 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2194 3692734 MIP simplex iterations 133632 branch-and-bound nodes absmipgap = 0.21875, relmipgap = 9.97037e-05 3 flow-cover cuts 12 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 = 195.7 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3023 2490353 MIP simplex iterations 53519 branch-and-bound nodes absmipgap = 0.294367, relmipgap = 9.73757e-05 2 flow-cover cuts 1 Gomory cut 2 implied-bound cuts 17 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 = 1257.31 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4760 16478078 MIP simplex iterations 371368 branch-and-bound nodes absmipgap = 0.472494, relmipgap = 9.92634e-05 1 Gomory cut 5 implied-bound cuts 21 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.01 Solve = 1986.18 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5163 26788809 MIP simplex iterations 604155 branch-and-bound nodes absmipgap = 0.5158, relmipgap = 9.99032e-05 1 Gomory cut 3 implied-bound cuts 15 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 807.74 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4544 10839688 MIP simplex iterations 240890 branch-and-bound nodes absmipgap = 0.452237, relmipgap = 9.95239e-05 2 Gomory cuts 20 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 608.23 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4151 7650155 MIP simplex iterations 149108 branch-and-bound nodes absmipgap = 0.414889, relmipgap = 9.99492e-05 1 flow-cover cut 1 implied-bound cut 41 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 679.42 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3303 8782953 MIP simplex iterations 229181 branch-and-bound nodes absmipgap = 0.328593, relmipgap = 9.94832e-05 1 Gomory cut 20 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 = 531.31 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3770 6489174 MIP simplex iterations 138420 branch-and-bound nodes absmipgap = 0.367309, relmipgap = 9.74294e-05 3 implied-bound cuts 32 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 = 1495.05 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5303 19063366 MIP simplex iterations 460197 branch-and-bound nodes absmipgap = 0.529631, relmipgap = 9.98739e-05 3 Gomory cuts 15 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 = 311.84 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4602 3936342 MIP simplex iterations 125848 branch-and-bound nodes absmipgap = 0.446773, relmipgap = 9.70823e-05 1 flow-cover cut 1 Gomory cut 3 implied-bound cuts 13 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 = 48.26 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4331 516359 MIP simplex iterations 18890 branch-and-bound nodes absmipgap = 0.423923, relmipgap = 9.78811e-05 2 flow-cover cuts 3 Gomory cuts 2 implied-bound cuts 12 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 = 729.93 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2823 9766377 MIP simplex iterations 122746 branch-and-bound nodes absmipgap = 0.282129, relmipgap = 9.99393e-05 14 flow-cover cuts 3 implied-bound cuts 34 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 = 1395.36 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 4774 18321669 MIP simplex iterations 427716 branch-and-bound nodes absmipgap = 0.473754, relmipgap = 9.92362e-05 3 flow-cover cuts 2 Gomory cuts 9 implied-bound cuts 25 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 2152.51 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5912 30636531 MIP simplex iterations 687325 branch-and-bound nodes absmipgap = 0.591191, relmipgap = 9.99985e-05 3 flow-cover cuts 1 Gomory cut 4 implied-bound cuts 7 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=4 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 503.51 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5438 6578415 MIP simplex iterations 146562 branch-and-bound nodes absmipgap = 0.543246, relmipgap = 9.98981e-05 1 Gomory cut 19 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 = 960.77 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3838 13189472 MIP simplex iterations 264089 branch-and-bound nodes absmipgap = 0.37727, relmipgap = 9.82986e-05 1 flow-cover cut 12 implied-bound cuts 24 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 = 748.29 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2622 9398071 MIP simplex iterations 234750 branch-and-bound nodes absmipgap = 0.260459, relmipgap = 9.93361e-05 3 Gomory cuts 4 implied-bound cuts 47 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.01 Solve = 851.05 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3001 11234055 MIP simplex iterations 244863 branch-and-bound nodes absmipgap = 0.299634, relmipgap = 9.98446e-05 2 flow-cover cuts 1 Gomory cut 35 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 = 792.57 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 6087 10107130 MIP simplex iterations 229210 branch-and-bound nodes absmipgap = 0.605696, relmipgap = 9.95064e-05 1 Gomory cut 9 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 = 208.05 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5880 2617128 MIP simplex iterations 126457 branch-and-bound nodes absmipgap = 0.586839, relmipgap = 9.98025e-05 1 Gomory cut 3 mixed-integer rounding cuts Solving problem with n=15 m=10 scen=4 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 59.01 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 5743 636561 MIP simplex iterations 23403 branch-and-bound nodes absmipgap = 0.534201, relmipgap = 9.30178e-05 2 flow-cover cuts 2 Gomory cuts 7 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=1 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 450.64 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2459 2861689 MIP simplex iterations 150475 branch-and-bound nodes absmipgap = 0.237475, relmipgap = 9.65738e-05 1 flow-cover cut 5 Gomory cuts 9 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 = 157.58 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2611 2371915 MIP simplex iterations 102131 branch-and-bound nodes absmipgap = 0.2455, relmipgap = 9.40254e-05 3 Gomory cuts 33 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 107.93 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2649 1501501 MIP simplex iterations 58359 branch-and-bound nodes absmipgap = 0.264545, relmipgap = 9.98661e-05 3 Gomory cuts 39 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 = 29.68 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2603 503320 MIP simplex iterations 20699 branch-and-bound nodes absmipgap = 0.240122, relmipgap = 9.22482e-05 3 Gomory cuts 5 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=5 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 139.43 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3001 1969837 MIP simplex iterations 82136 branch-and-bound nodes absmipgap = 0.297573, relmipgap = 9.9158e-05 5 Gomory cuts 9 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 = 27.72 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3184 418532 MIP simplex iterations 15836 branch-and-bound nodes absmipgap = 0.312078, relmipgap = 9.80144e-05 3 Gomory cuts 48 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=7 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 151.4 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2622 2526298 MIP simplex iterations 133614 branch-and-bound nodes absmipgap = 0.259112, relmipgap = 9.88224e-05 3 Gomory cuts 4 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 = 60.8 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3044 789155 MIP simplex iterations 42953 branch-and-bound nodes absmipgap = 0.296102, relmipgap = 9.72741e-05 5 Gomory cuts 6 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=1 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 22.15 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2780 410468 MIP simplex iterations 12108 branch-and-bound nodes absmipgap = 0.167774, relmipgap = 6.03505e-05 1 Gomory cut 23 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.09 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3193 752988 MIP simplex iterations 44881 branch-and-bound nodes absmipgap = 0.319065, relmipgap = 9.99263e-05 6 Gomory cuts 9 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 = 3694.49 Output = 0.02 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 918 47287292 MIP simplex iterations 1772706 branch-and-bound nodes absmipgap = 0.0911271, relmipgap = 9.92669e-05 1 flow-cover cut 10 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 = 993 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1597 15561791 MIP simplex iterations 470831 branch-and-bound nodes absmipgap = 0.159397, relmipgap = 9.98103e-05 3 flow-cover cuts 2 Gomory cuts 64 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 250.88 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 559 3819295 MIP simplex iterations 66564 branch-and-bound nodes absmipgap = 0.0429907, relmipgap = 7.69064e-05 2 flow-cover cuts 2 Gomory cuts 3 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 = 199.46 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 545 3395612 MIP simplex iterations 64935 branch-and-bound nodes absmipgap = 0.00906267, relmipgap = 1.66288e-05 10 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 = 676.58 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1064 10432712 MIP simplex iterations 417937 branch-and-bound nodes absmipgap = 0.100855, relmipgap = 9.47884e-05 3 flow-cover cuts 1 Gomory cut 5 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 = 15.02 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1541 165483 MIP simplex iterations 6621 branch-and-bound nodes absmipgap = 0.128177, relmipgap = 8.31779e-05 1 flow-cover cut 5 Gomory cuts 34 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 = 812.67 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 777 9882897 MIP simplex iterations 402852 branch-and-bound nodes absmipgap = 0.0711114, relmipgap = 9.15205e-05 1 flow-cover cut 3 Gomory cuts 5 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 = 110.75 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1258 1734580 MIP simplex iterations 87834 branch-and-bound nodes absmipgap = 0.122173, relmipgap = 9.71166e-05 2 flow-cover cuts 3 Gomory cuts 3 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=9 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 78.09 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 988 1167227 MIP simplex iterations 35149 branch-and-bound nodes absmipgap = 0.00588604, relmipgap = 5.95753e-06 2 Gomory cuts 9 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=2 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 105.17 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1310 1523119 MIP simplex iterations 86159 branch-and-bound nodes absmipgap = 0.0945622, relmipgap = 7.21849e-05 4 flow-cover cuts 7 Gomory cuts 3 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.01 Solve = 250.5 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2976 3547728 MIP simplex iterations 184809 branch-and-bound nodes absmipgap = 0.273112, relmipgap = 9.17714e-05 1 flow-cover cut 3 Gomory cuts 22 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 = 836.07 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3335 12763273 MIP simplex iterations 541100 branch-and-bound nodes absmipgap = 0.331246, relmipgap = 9.93242e-05 4 Gomory cuts 36 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.01 Solve = 170.56 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2786 2502935 MIP simplex iterations 100165 branch-and-bound nodes absmipgap = 0.278299, relmipgap = 9.9892e-05 2 Gomory cuts 45 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 = 35.13 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2781 496675 MIP simplex iterations 36542 branch-and-bound nodes absmipgap = 0.270693, relmipgap = 9.73366e-05 1 flow-cover cut 6 Gomory cuts 2 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.01 Solve = 133.76 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3064 2094795 MIP simplex iterations 82172 branch-and-bound nodes absmipgap = 0.231485, relmipgap = 7.55498e-05 1 flow-cover cut 3 Gomory cuts 19 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=6 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 35.01 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3181 480148 MIP simplex iterations 21032 branch-and-bound nodes absmipgap = 0.317952, relmipgap = 9.99535e-05 2 flow-cover cuts 2 Gomory cuts 35 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 = 382.45 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2887 6048472 MIP simplex iterations 304289 branch-and-bound nodes absmipgap = 0.287854, relmipgap = 9.9707e-05 2 flow-cover cuts 3 Gomory cuts 6 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 = 38.88 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3068 555580 MIP simplex iterations 24199 branch-and-bound nodes absmipgap = 0.305364, relmipgap = 9.95319e-05 1 flow-cover cut 6 Gomory cuts 18 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 = 65.04 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2885 973336 MIP simplex iterations 39971 branch-and-bound nodes absmipgap = 0.280552, relmipgap = 9.7245e-05 2 Gomory cuts 28 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=3 seed=10 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 313.08 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3706 4473147 MIP simplex iterations 208318 branch-and-bound nodes absmipgap = 0.35318, relmipgap = 9.52994e-05 7 Gomory cuts 17 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 = 2912.01 Output = 0.02 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2981 34593952 MIP simplex iterations 1909924 branch-and-bound nodes absmipgap = 0.298016, relmipgap = 9.99719e-05 3 flow-cover cuts 7 Gomory cuts 21 implied-bound cuts 23 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.01 Solve = 1954.31 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3495 27127447 MIP simplex iterations 1267680 branch-and-bound nodes absmipgap = 0.348742, relmipgap = 9.97831e-05 4 flow-cover cuts 2 Gomory cuts 9 implied-bound cuts 30 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=3 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0 Solve = 1967.14 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1390 31404424 MIP simplex iterations 836912 branch-and-bound nodes absmipgap = 0.136515, relmipgap = 9.82124e-05 5 flow-cover cuts 43 implied-bound cuts 15 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.01 Solve = 155.59 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2112 1822597 MIP simplex iterations 114430 branch-and-bound nodes absmipgap = 0.202981, relmipgap = 9.61084e-05 1 flow-cover cut 7 Gomory cuts 8 implied-bound cuts 16 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 = 3028 Output = 0.03 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1534 49831435 MIP simplex iterations 1907123 branch-and-bound nodes absmipgap = 0.15334, relmipgap = 9.99611e-05 8 flow-cover cuts 1 Gomory cut 31 implied-bound cuts 12 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 = 12.78 Output = 0.02 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1591 152322 MIP simplex iterations 5828 branch-and-bound nodes absmipgap = 0.136759, relmipgap = 8.59578e-05 5 Gomory cuts 5 implied-bound cuts 18 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 = 1303.94 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2677 15882504 MIP simplex iterations 881846 branch-and-bound nodes absmipgap = 0.266825, relmipgap = 9.96731e-05 3 flow-cover cuts 5 Gomory cuts 18 implied-bound cuts 12 mixed-integer rounding cuts Solving problem with n=20 m=3 scen=4 seed=8 CPLEX 12.1.0: timing=1 Times (seconds): Input = 0.01 Solve = 394.48 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 2589 5098944 MIP simplex iterations 218323 branch-and-bound nodes absmipgap = 0.25082, relmipgap = 9.68791e-05 7 flow-cover cuts 9 Gomory cuts 17 implied-bound cuts 26 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.01 Solve = 677.88 Output = 0.01 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 1637 9660745 MIP simplex iterations 263665 branch-and-bound nodes absmipgap = 0.160088, relmipgap = 9.77932e-05 1 flow-cover cut 1 Gomory cut 10 implied-bound cuts 85 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 = 426.34 Output = 0 CPLEX 12.1.0: optimal integer solution within mipgap or absmipgap; objective 3494 6393892 MIP simplex iterations 305602 branch-and-bound nodes absmipgap = 0.348412, relmipgap = 9.97173e-05 1 flow-cover cut 4 Gomory cuts 12 implied-bound cuts 16 mixed-integer rounding cuts