HEAD is now at 0bbc05b initial deployement 17641 packages (729 installed, 16912 uninstalled), 5966 virtual packages Presolve has eliminated 38054 rows and 4985 columns... Aggregator has done 9809 substitutions... Presolve has improved bounds 335 times... Tried aggregator 5 times. MIP Presolve eliminated 41379 rows and 5244 columns. MIP Presolve modified 199977 coefficients. Aggregator did 9809 substitutions. Reduced MIP has 102055 rows, 26085 columns, and 608138 nonzeros. Reduced MIP has 25137 binaries, 948 generals, 0 SOSs, and 0 indicators. Presolve time = 5.57 sec. Clique table members: 44963. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 2.09 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 175152.8210 548 175152.8210 1566 0 0 193072.2381 429 Cuts: 476 1771 * 0 0 integral 0 203005.0000 Cuts: 19 1836 0.00% 0 0 cutoff 203005.0000 203005.0000 1836 0.00% Elapsed real time = 14.99 sec. (tree size = 0.00 MB, solutions = 1) GUB cover cuts applied: 5 Clique cuts applied: 100 Cover cuts applied: 2 Implied bound cuts applied: 17 Flow cuts applied: 2 Mixed integer rounding cuts applied: 5 Zero-half cuts applied: 41 Gomory fractional cuts applied: 9 Root node processing (before b&c): Real time = 9.43 Parallel b&c, 2 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 9.43 sec. >>>>>>> Objval = 203005.000000 (int)203005 >>>>>>>>>>>>> Objval 0/1 = 161.000000 >>>>>>>>>>>>> Objval 0/0 = 34.000000 1 of 1 MIP starts provided solutions. MIP start 'm1' defined initial solution with objective 316731.0000. Presolve has eliminated 37569 rows and 4800 columns... Aggregator has done 9669 substitutions... Presolve has improved bounds 335 times... Tried aggregator 5 times. MIP Presolve eliminated 41131 rows and 5156 columns. MIP Presolve modified 199892 coefficients. Aggregator did 9714 substitutions. Reduced MIP has 102398 rows, 26268 columns, and 620749 nonzeros. Reduced MIP has 25320 binaries, 948 generals, 0 SOSs, and 0 indicators. Presolve time = 7.67 sec. Clique table members: 45278. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 7.19 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0+ 0 316731.0000 7474 --- 0 0 8180.1016 1309 316731.0000 8180.1016 7474 97.42% 0 0 185253.5217 112 316731.0000 Cuts: 313 9547 41.51% 0 0 191221.5000 10 316731.0000 Cuts: 22 9598 39.63% * 0+ 0 191222.0000 191221.5000 9598 0.00% 0 0 cutoff 191222.0000 191221.5000 9598 0.00% Elapsed real time = 28.14 sec. (tree size = 0.00 MB, solutions = 1) GUB cover cuts applied: 1 Clique cuts applied: 61 Implied bound cuts applied: 13 Flow cuts applied: 4 Mixed integer rounding cuts applied: 2 Zero-half cuts applied: 23 Gomory fractional cuts applied: 16 Root node processing (before b&c): Real time = 19.97 Parallel b&c, 2 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 19.97 sec.