Warning: Output names have been modified to conform to LP format. Default row names c1, c2 ... being created. Tried aggregator 9 times. MIP Presolve eliminated 149633 rows and 29444 columns. MIP Presolve modified 1606 coefficients. Aggregator did 1862 substitutions. Reduced MIP has 688 rows, 470 columns, and 1708 nonzeros. Presolve time = 0.33 sec. Clique table members: 483. 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 -1144.0000 -1144.0000 25 0.00% >>>>>>> Objval = -1144.000000 (int)-1144 Warning: Output names have been modified to conform to LP format. Default row names c1, c2 ... being created. MIP start values provide initial solution with objective 172.0000. Tried aggregator 5 times. MIP Presolve eliminated 150453 rows and 30064 columns. MIP Presolve modified 686 coefficients. Aggregator did 1651 substitutions. Reduced MIP has 79 rows, 61 columns, and 194 nonzeros. Presolve time = 0.27 sec. Clique table members: 50. 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 1.0000 3 12.0000 1.0000 4 91.67% * 0+ 0 1.0000 1.0000 4 0.00% 0 0 cutoff 1.0000 1.0000 4 0.00% >>>>>>> Objval = 1.000000 (int)1 Warning: Output names have been modified to conform to LP format. Default row names c1, c2 ... being created. MIP start values provide initial solution with objective 2322.0000. Tried aggregator 4 times. MIP Presolve eliminated 150186 rows and 29801 columns. MIP Presolve modified 658 coefficients. Aggregator did 1812 substitutions. Reduced MIP has 185 rows, 163 columns, and 482 nonzeros. Presolve time = 0.29 sec. Clique table members: 167. 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 integral 0 465.0000 465.0000 1 0.00%