HEAD is now at 0bbc05b initial deployement 5263 packages (670 installed, 4593 uninstalled), 3286 virtual packages Tried aggregator 6 times. MIP Presolve eliminated 27002 rows and 4182 columns. MIP Presolve modified 27873 coefficients. Aggregator did 3063 substitutions. Reduced MIP has 16605 rows, 7458 columns, and 61161 nonzeros. Reduced MIP has 7230 binaries, 228 generals, 0 SOSs, and 0 indicators. Presolve time = 0.80 sec. Clique table members: 9675. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.09 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 72329.8333 35 72329.8333 480 * 0+ 0 78901.0000 72329.8333 480 8.33% * 0 0 integral 0 75606.0000 Cuts: 68 486 0.00% 0 0 cutoff 75606.0000 75606.0000 486 0.00% GUB cover cuts applied: 1 Clique cuts applied: 21 Cover cuts applied: 1 Implied bound cuts applied: 2 Mixed integer rounding cuts applied: 1 Zero-half cuts applied: 1 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 0.54 Parallel b&c, 2 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 0.54 sec. >>>>>>> Objval = 75606.000000 (int)75606 >>>>>>>>>>>>> Objval 0/1 = 28.000000 >>>>>>>>>>>>> Objval 0/0 = 23.000000 1 of 2 MIP starts provided solutions. MIP start 'm1' defined initial solution with objective 266628.0000. Tried aggregator 6 times. MIP Presolve eliminated 26849 rows and 4129 columns. MIP Presolve modified 27070 coefficients. Aggregator did 3000 substitutions. Reduced MIP has 16795 rows, 7574 columns, and 63611 nonzeros. Reduced MIP has 7352 binaries, 222 generals, 0 SOSs, and 0 indicators. Presolve time = 0.85 sec. Clique table members: 10013. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.30 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0+ 0 266628.0000 1890 --- 0 0 317.6106 547 266628.0000 317.6106 1890 99.88% 0 0 13566.4615 28 266628.0000 Cuts: 108 2109 94.91% * 0+ 0 16858.0000 13566.4615 2109 19.53% * 0+ 0 13576.0000 13566.4615 2109 0.07% * 0+ 0 13571.0000 13566.4615 2109 0.03% Repeating presolve. Tried aggregator 6 times. MIP Presolve eliminated 15206 rows and 6044 columns. MIP Presolve modified 364 coefficients. Aggregator did 1272 substitutions. Reduced MIP has 317 rows, 258 columns, and 1190 nonzeros. Reduced MIP has 258 binaries, 0 generals, 0 SOSs, and 0 indicators. Tried aggregator 1 time. MIP Presolve eliminated 12 rows and 9 columns. MIP Presolve modified 45 coefficients. Aggregator did 2 substitutions. Reduced MIP has 303 rows, 247 columns, and 1140 nonzeros. Reduced MIP has 247 binaries, 0 generals, 0 SOSs, and 0 indicators. Tried aggregator 2 times. MIP Presolve eliminated 2 rows and 1 columns. Aggregator did 1 substitutions. Reduced MIP has 300 rows, 245 columns, and 1134 nonzeros. Reduced MIP has 245 binaries, 0 generals, 0 SOSs, and 0 indicators. Represolve time = 0.06 sec. Clique table members: 473. 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 13571.0000 13566.4615 2152 0.03% 0 0 13568.4615 15 13571.0000 13568.4615 2152 0.02% Repeating presolve. Tried aggregator 3 times. MIP Presolve eliminated 199 rows and 159 columns. MIP Presolve modified 60 coefficients. Aggregator did 10 substitutions. Reduced MIP has 91 rows, 76 columns, and 307 nonzeros. Reduced MIP has 76 binaries, 0 generals, 0 SOSs, and 0 indicators. Tried aggregator 1 time. Represolve time = 0.01 sec. Clique table members: 113. 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 13571.0000 13568.4615 2179 0.02% 0 0 13568.4615 15 13571.0000 13568.4615 2179 0.02% 0 2 13568.4615 15 13571.0000 13568.4615 2179 0.02% Zero-half cuts applied: 3 Gomory fractional cuts applied: 2 Root node processing (before b&c): Real time = 1.02 Parallel b&c, 2 threads: Real time = 0.13 Sync time (average) = 0.00 Wait time (average) = 0.06 ------- Total (root+branch&cut) = 1.15 sec.