HEAD is now at 0bbc05b initial deployement 17397 packages (729 installed, 16668 uninstalled), 5957 virtual packages Presolve has eliminated 39056 rows and 4460 columns... Aggregator has done 9949 substitutions... Presolve has improved bounds 222 times... Tried aggregator 5 times. MIP Presolve eliminated 42181 rows and 4705 columns. MIP Presolve modified 196839 coefficients. Aggregator did 9950 substitutions. Reduced MIP has 99433 rows, 26087 columns, and 581755 nonzeros. Reduced MIP has 25169 binaries, 918 generals, 0 SOSs, and 0 indicators. Presolve time = 5.58 sec. Clique table members: 44238. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 1.87 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 180880.6847 1680 180880.6847 2356 0 0 226455.5000 79 Cuts: 1201 2674 * 0+ 0 232411.0000 226455.5000 2674 2.56% 0 0 226456.0000 9 232411.0000 Cuts: 17 2708 2.56% * 0+ 0 226456.0000 226456.0000 2708 0.00% 0 0 cutoff 226456.0000 226456.0000 2708 0.00% Elapsed real time = 15.71 sec. (tree size = 0.00 MB, solutions = 2) GUB cover cuts applied: 5 Clique cuts applied: 805 Cover cuts applied: 18 Implied bound cuts applied: 63 Flow cuts applied: 1 Mixed integer rounding cuts applied: 9 Zero-half cuts applied: 56 Gomory fractional cuts applied: 7 Root node processing (before b&c): Real time = 10.15 Parallel b&c, 2 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 10.15 sec. >>>>>>> Objval = 226456.000000 (int)226456 >>>>>>>>>>>>> Objval 0/1 = 90.000000 >>>>>>>>>>>>> Objval 0/0 = 38.000000 1 of 2 MIP starts provided solutions. MIP start 'm1' defined initial solution with objective 364066.0000. Presolve has eliminated 38163 rows and 4255 columns... Aggregator has done 9793 substitutions... Presolve has improved bounds 223 times... Tried aggregator 5 times. MIP Presolve eliminated 41898 rows and 4613 columns. MIP Presolve modified 196785 coefficients. Aggregator did 9838 substitutions. Reduced MIP has 99828 rows, 26291 columns, and 594537 nonzeros. Reduced MIP has 25373 binaries, 918 generals, 0 SOSs, and 0 indicators. Presolve time = 7.12 sec. Clique table members: 44583. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 7.50 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0+ 0 364066.0000 5935 --- 0 0 290.0975 1504 364066.0000 290.0975 5935 99.92% 0 0 103331.4463 130 364066.0000 Cuts: 281 7594 71.62% 0 0 110637.0000 70 364066.0000 Cuts: 31 7638 69.61% 0 0 123656.8333 138 364066.0000 Cuts: 10 7713 66.03% 0 0 124893.2358 150 364066.0000 Cuts: 4 7722 65.69% 0 0 127864.7358 32 364066.0000 Cuts: 5 7728 64.88% 0 0 127864.7358 32 364066.0000 Cuts: 2 7729 64.88% 0 0 127864.7358 32 364066.0000 Cuts: 2 7730 64.88% * 0+ 0 131487.0000 127864.7358 7730 2.75% * 0+ 0 131486.0000 127864.7358 7730 2.75% Repeating presolve. Tried aggregator 6 times. MIP Presolve eliminated 94347 rows and 21318 columns. MIP Presolve modified 4425 coefficients. Aggregator did 3920 substitutions. Reduced MIP has 1561 rows, 1053 columns, and 6087 nonzeros. Reduced MIP has 1046 binaries, 7 generals, 0 SOSs, and 0 indicators. Tried aggregator 6 times. MIP Presolve eliminated 468 rows and 244 columns. MIP Presolve modified 37 coefficients. Aggregator did 113 substitutions. Reduced MIP has 978 rows, 696 columns, and 3874 nonzeros. Reduced MIP has 690 binaries, 6 generals, 0 SOSs, and 0 indicators. Tried aggregator 3 times. MIP Presolve eliminated 17 rows and 11 columns. MIP Presolve modified 5 coefficients. Aggregator did 28 substitutions. Reduced MIP has 933 rows, 657 columns, and 3758 nonzeros. Reduced MIP has 651 binaries, 6 generals, 0 SOSs, and 0 indicators. Tried aggregator 1 time. Aggregator did 2 substitutions. Reduced MIP has 931 rows, 655 columns, and 3754 nonzeros. Reduced MIP has 649 binaries, 6 generals, 0 SOSs, and 0 indicators. Represolve time = 0.60 sec. Clique table members: 1518. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.00 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0+ 0 131486.0000 127864.7358 7866 2.75% 0 0 128789.0377 9 131486.0000 128789.0377 7866 2.05% 0 0 128789.0377 9 131486.0000 128789.0377 7866 2.05% Elapsed real time = 32.92 sec. (tree size = 0.01 MB, solutions = 2) GUB cover cuts applied: 1 Clique cuts applied: 2 Implied bound cuts applied: 1 Flow cuts applied: 8 Mixed integer rounding cuts applied: 2 Zero-half cuts applied: 17 Gomory fractional cuts applied: 6 Root node processing (before b&c): Real time = 25.23 Parallel b&c, 2 threads: Real time = 0.08 Sync time (average) = 0.00 Wait time (average) = 0.03 ------- Total (root+branch&cut) = 25.31 sec.