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 270871 rows and 47482 columns. MIP Presolve modified 15203 coefficients. Aggregator did 2273 substitutions. Reduced MIP has 5268 rows, 2173 columns, and 16819 nonzeros. Presolve time = 1.37 sec. Clique table members: 2658. 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 -550.0000 6 -550.0000 141 * 0+ 0 -550.0000 -550.0000 141 0.00% 0 0 cutoff -550.0000 -550.0000 141 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 571.0000. Tried aggregator 8 times. MIP Presolve eliminated 275241 rows and 48989 columns. MIP Presolve modified 15354 coefficients. Aggregator did 2460 substitutions. Reduced MIP has 710 rows, 479 columns, and 2102 nonzeros. Presolve time = 1.40 sec. Clique table members: 425. 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 92.0000 8 571.0000 92.0000 31 83.89% * 0+ 0 94.0000 92.0000 31 2.13% 0 0 infeasible 94.0000 92.0000 32 2.13% >>>>>>> Objval = 94.000000 (int)94 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 1665.0000. Tried aggregator 7 times. MIP Presolve eliminated 273233 rows and 47885 columns. MIP Presolve modified 16030 coefficients. Aggregator did 2372 substitutions. Reduced MIP has 2805 rows, 1671 columns, and 9181 nonzeros. Presolve time = 1.70 sec. Clique table members: 1511. 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 666.7500 46 1665.0000 666.7500 194 59.95% * 0 0 integral 0 705.0000 Cuts: 3 230 0.00% 0 0 cutoff 705.0000 705.0000 230 0.00% Zero-half cuts applied: 1