HEAD is now at 0bbc05b initial deployement 3191 packages (1621 installed, 1570 uninstalled), 3104 virtual packages Tried aggregator 6 times. MIP Presolve eliminated 18637 rows and 5253 columns. MIP Presolve modified 3688 coefficients. Aggregator did 3825 substitutions. Reduced MIP has 4241 rows, 2245 columns, and 12733 nonzeros. Reduced MIP has 2089 binaries, 156 generals, 0 SOSs, and 0 indicators. Presolve time = 0.18 sec. Clique table members: 3647. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.01 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0 0 integral 0 431456.0000 431456.0000 109 0.00% >>>>>>> Objval = 431456.000000 (int)431456 >>>>>>>>>>>>> Objval 0/1 = -0.000000 >>>>>>>>>>>>> Objval 0/0 = 139.000000 1 of 1 MIP starts provided solutions. MIP start 'm1' defined initial solution with objective 93478.0000. Tried aggregator 5 times. MIP Presolve eliminated 24913 rows and 9695 columns. MIP Presolve modified 1717 coefficients. Aggregator did 1294 substitutions. Reduced MIP has 496 rows, 334 columns, and 1393 nonzeros. Reduced MIP has 311 binaries, 23 generals, 0 SOSs, and 0 indicators. Presolve time = 0.05 sec. Clique table members: 506. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.01 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0+ 0 93478.0000 81 --- 0 0 37391.5217 53 93478.0000 37391.5217 81 60.00% * 0+ 0 43599.0000 37391.5217 81 14.24% * 0+ 0 37395.0000 37391.5217 81 0.01% Repeating presolve. Tried aggregator 2 times. MIP Presolve eliminated 487 rows and 325 columns. MIP Presolve modified 2 coefficients. Aggregator did 4 substitutions. Reduced MIP has 5 rows, 5 columns, and 11 nonzeros. Reduced MIP has 5 binaries, 0 generals, 0 SOSs, and 0 indicators. Tried aggregator 1 time. Represolve time = 0.00 sec. Clique table members: 4. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.00 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0+ 0 37395.0000 37391.5217 132 0.01% * 0 0 integral 0 37394.0000 37394.0000 132 0.00%