Warning: Output names have been modified to conform to LP format. Default row names c1, c2 ... being created. Tried aggregator 6 times. MIP Presolve eliminated 270276 rows and 47271 columns. MIP Presolve modified 14350 coefficients. Aggregator did 2275 substitutions. Reduced MIP has 5861 rows, 2382 columns, and 19623 nonzeros. Presolve time = 1.77 sec. Clique table members: 2727. 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 -550.0000 23 -550.0000 187 * 0+ 0 -550.0000 -550.0000 187 0.00% 0 0 cutoff -550.0000 -550.0000 187 0.00% >>>>>>> Objval = -550.000000 (int)-550 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 579.0000. Tried aggregator 8 times. MIP Presolve eliminated 274932 rows and 48811 columns. MIP Presolve modified 15057 coefficients. Aggregator did 2480 substitutions. Reduced MIP has 999 rows, 637 columns, and 3092 nonzeros. Presolve time = 1.88 sec. Clique table members: 590. 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 91.0000 91.0000 40 0.00% >>>>>>> Objval = 91.000000 (int)91 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 1641.0000. Tried aggregator 7 times. MIP Presolve eliminated 272843 rows and 47759 columns. MIP Presolve modified 15949 coefficients. Aggregator did 2364 substitutions. Reduced MIP has 3203 rows, 1805 columns, and 10418 nonzeros. Presolve time = 2.04 sec. Clique table members: 1715. 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 748.0000 4 1641.0000 748.0000 389 54.42% * 0+ 0 749.0000 748.0000 389 0.13% * 0+ 0 748.0000 748.0000 390 0.00% 0 0 cutoff 748.0000 748.0000 390 0.00%