Warning: Output names have been modified to conform to LP format. Default row names c1, c2 ... being created. Tried aggregator 7 times. MIP Presolve eliminated 269423 rows and 47075 columns. MIP Presolve modified 17423 coefficients. Aggregator did 2263 substitutions. Reduced MIP has 6717 rows, 2590 columns, and 21648 nonzeros. Presolve time = 1.60 sec. Clique table members: 3085. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.05 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 -547.0000 135 -547.0000 340 * 0+ 0 -547.0000 -547.0000 340 0.00% 0 0 cutoff -547.0000 -547.0000 340 0.00% >>>>>>> Objval = -547.000000 (int)-547 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 600.0000. Tried aggregator 11 times. MIP Presolve eliminated 274384 rows and 48576 columns. MIP Presolve modified 17782 coefficients. Aggregator did 2535 substitutions. Reduced MIP has 1491 rows, 817 columns, and 4692 nonzeros. Presolve time = 1.94 sec. Clique table members: 847. 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 28.0000 28.0000 56 0.00% >>>>>>> Objval = 28.000000 (int)28 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 1759.0000. Tried aggregator 8 times. MIP Presolve eliminated 275624 rows and 49216 columns. MIP Presolve modified 17870 coefficients. Aggregator did 2514 substitutions. Reduced MIP has 272 rows, 198 columns, and 662 nonzeros. Presolve time = 2.14 sec. Clique table members: 251. 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 859.0000 859.0000 1 0.00%