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 209258 rows and 18113 columns. MIP Presolve modified 287 coefficients. Aggregator did 2331 substitutions. Reduced MIP has 893 rows, 289 columns, and 2637 nonzeros. Presolve time = 0.29 sec. Clique table members: 222. 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 0.0000 0.0000 0 0.00% 0 0 cutoff 0.0000 0.0000 0 0.00% >>>>>>> Objval = 0.000000 (int)0 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 231.0000. Tried aggregator 9 times. MIP Presolve eliminated 209272 rows and 18138 columns. MIP Presolve modified 80 coefficients. Aggregator did 2241 substitutions. Reduced MIP has 969 rows, 354 columns, and 3016 nonzeros. Presolve time = 0.31 sec. Clique table members: 288. 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 2.0000 2.0000 0 0.00% >>>>>>> Objval = 2.000000 (int)2 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 1769.0000. Tried aggregator 9 times. MIP Presolve eliminated 209060 rows and 18007 columns. MIP Presolve modified 29 coefficients. Aggregator did 1902 substitutions. Reduced MIP has 1520 rows, 824 columns, and 3645 nonzeros. Presolve time = 0.32 sec. Clique table members: 1475. 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 126.0000 126.0000 0 0.00%