Warning: Output names have been modified to conform to LP format. Default row names c1, c2 ... being created. Tried aggregator 8 times. MIP Presolve eliminated 270839 rows and 47421 columns. MIP Presolve modified 15421 coefficients. Aggregator did 2367 substitutions. Reduced MIP has 5249 rows, 2140 columns, and 17423 nonzeros. Presolve time = 1.84 sec. Clique table members: 2538. 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 -544.0000 21 -544.0000 224 * 0+ 0 -544.0000 -544.0000 224 0.00% 0 0 cutoff -544.0000 -544.0000 224 0.00% >>>>>>> Objval = -544.000000 (int)-544 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 684.0000. Tried aggregator 6 times. MIP Presolve eliminated 270633 rows and 47404 columns. MIP Presolve modified 15321 coefficients. Aggregator did 2269 substitutions. Reduced MIP has 5560 rows, 2255 columns, and 18955 nonzeros. Presolve time = 1.43 sec. Clique table members: 2469. 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 11.0000 5 684.0000 11.0000 391 98.39% * 0+ 0 11.0000 11.0000 391 0.00% 0 0 cutoff 11.0000 11.0000 391 0.00% >>>>>>> Objval = 11.000000 (int)11 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 2043.0000. Tried aggregator 7 times. MIP Presolve eliminated 268150 rows and 46328 columns. MIP Presolve modified 14941 coefficients. Aggregator did 2151 substitutions. Reduced MIP has 8155 rows, 3449 columns, and 29350 nonzeros. Presolve time = 1.85 sec. Clique table members: 2971. MIP emphasis: balance optimality and feasibility. MIP search method: dynamic search. Parallel mode: none, using 1 thread. Root relaxation solution time = 0.07 sec. Nodes Cuts/ Node Left Objective IInf Best Integer Best Node ItCnt Gap 0 0 997.0000 6 1200.0000 997.0000 898 16.92% * 0+ 0 998.0000 997.0000 898 0.10% * 0+ 0 997.0000 997.0000 900 0.00% 0 0 cutoff 997.0000 997.0000 900 0.00%