HEAD is now at 0bbc05b initial deployement 5663 packages (670 installed, 4993 uninstalled), 3597 virtual packages Tried aggregator 7 times. MIP Presolve eliminated 18182 rows and 3888 columns. MIP Presolve modified 25155 coefficients. Aggregator did 3499 substitutions. Reduced MIP has 29432 rows, 8770 columns, and 107723 nonzeros. Reduced MIP has 8439 binaries, 331 generals, 0 SOSs, and 0 indicators. Presolve time = 1.03 sec. Clique table members: 12640. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.27 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 57583.5556 115 57583.5556 513 * 0+ 0 61180.0000 57583.5556 513 5.88% * 0 0 integral 0 57588.0000 Cuts: 85 514 0.00% 0 0 cutoff 57588.0000 57588.0000 514 0.00% Root node processing (before b&c): Real time = 1.17 Parallel b&c, 2 threads: Real time = 0.00 Sync time (average) = 0.00 Wait time (average) = 0.00 ------- Total (root+branch&cut) = 1.17 sec. >>>>>>> Objval = 57588.000000 (int)57588 >>>>>>>>>>>>> Objval 0/1 = 36.000000 >>>>>>>>>>>>> Objval 0/0 = 16.000000 1 of 2 MIP starts provided solutions. MIP start 'm1' defined initial solution with objective 249005.0000. Tried aggregator 7 times. MIP Presolve eliminated 34625 rows and 5682 columns. MIP Presolve modified 27556 coefficients. Aggregator did 4242 substitutions. Reduced MIP has 12246 rows, 6233 columns, and 44912 nonzeros. Reduced MIP has 6042 binaries, 191 generals, 0 SOSs, and 0 indicators. Presolve time = 0.90 sec. Clique table members: 1643. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: deterministic, using up to 2 threads. Root relaxation solution time = 0.19 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0+ 0 249005.0000 1422 --- 0 0 11287.6333 54 249005.0000 11287.6333 1422 95.47% 0 0 11290.3023 19 249005.0000 Cuts: 43 1436 95.47% * 0+ 0 11293.0000 11290.3023 1436 0.02% * 0+ 0 11292.0000 11290.3023 1436 0.02% Repeating presolve. Tried aggregator 4 times. MIP Presolve eliminated 11974 rows and 5957 columns. MIP Presolve modified 47 coefficients. Aggregator did 254 substitutions. Reduced MIP has 18 rows, 22 columns, and 49 nonzeros. Reduced MIP has 22 binaries, 0 generals, 0 SOSs, and 0 indicators. Tried aggregator 1 time. MIP Presolve eliminated 1 rows and 7 columns. Reduced MIP has 17 rows, 15 columns, and 42 nonzeros. Reduced MIP has 15 binaries, 0 generals, 0 SOSs, and 0 indicators. Tried aggregator 1 time. Represolve time = 0.03 sec. Clique table members: 15. 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 11292.0000 11290.3023 1447 0.02% 0 0 11290.5000 6 11292.0000 11290.5000 1447 0.01% 0 2 11290.5000 6 11292.0000 11290.5000 1447 0.01% Zero-half cuts applied: 1 Gomory fractional cuts applied: 1 Root node processing (before b&c): Real time = 0.61 Parallel b&c, 2 threads: Real time = 0.14 Sync time (average) = 0.00 Wait time (average) = 0.05 ------- Total (root+branch&cut) = 0.75 sec.