HEAD is now at 0bbc05b initial deployement 3115 packages (1621 installed, 1494 uninstalled), 3071 virtual packages Tried aggregator 8 times. MIP Presolve eliminated 17366 rows and 4732 columns. MIP Presolve modified 3821 coefficients. Aggregator did 4066 substitutions. Reduced MIP has 4796 rows, 2399 columns, and 14364 nonzeros. Reduced MIP has 2218 binaries, 181 generals, 0 SOSs, and 0 indicators. Presolve time = 0.20 sec. Clique table members: 4178. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.02 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap * 0 0 integral 0 199615.0000 199615.0000 60 0.00% >>>>>>> Objval = 199615.000000 (int)199615 >>>>>>>>>>>>> Objval 0/1 = -0.000000 >>>>>>>>>>>>> Objval 0/0 = 65.000000 1 of 1 MIP starts provided solutions. MIP start 'm1' defined initial solution with objective 89374.0000. Tried aggregator 4 times. MIP Presolve eliminated 24235 rows and 9364 columns. MIP Presolve modified 1631 coefficients. Aggregator did 1446 substitutions. Reduced MIP has 547 rows, 387 columns, and 1533 nonzeros. Reduced MIP has 357 binaries, 30 generals, 0 SOSs, and 0 indicators. Presolve time = 0.05 sec. Clique table members: 538. 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 89374.0000 87 --- 0 0 43085.5217 50 89374.0000 43085.5217 87 51.79% * 0+ 0 46157.0000 43085.5217 87 6.65% * 0+ 0 43088.0000 43085.5217 87 0.01% Repeating presolve. Tried aggregator 2 times. MIP Presolve eliminated 535 rows and 375 columns. MIP Presolve modified 2 coefficients. Aggregator did 7 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 43088.0000 43085.5217 137 0.01% * 0 0 integral 0 43087.0000 43087.0000 137 0.00%