Build (method = -2) #dp: 26030 Step-3' Graph: 1286 vertices and 5430 arcs (0.16s) Step-4' Graph: 1228 vertices and 5314 arcs (0.17s) #V4/#V3 = 0.95 #A4/#A3 = 0.98 Ready! (0.17s) Optimize a model with 1237 rows, 5315 columns and 13508 nonzeros Presolve removed 395 rows and 764 columns Presolve time: 0.08s Presolved: 842 rows, 4551 columns, 12328 nonzeros Variable types: 0 continuous, 4551 integer (0 binary) Found heuristic solution: objective 1000.0000000 Optimize a model with 842 rows, 4551 columns and 12328 nonzeros Presolved: 842 rows, 4551 columns, 12328 nonzeros Root barrier log... Ordering time: 0.01s Barrier statistics: AA' NZ : 6.911e+03 Factor NZ : 6.065e+04 (roughly 3 MBytes of memory) Factor Ops : 8.823e+06 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 9.09626528e+03 -9.03023945e+05 7.66e+05 2.22e-16 8.29e+02 0s 1 2.64001968e+03 -6.63930516e+05 1.24e+05 6.66e-16 1.82e+02 0s 2 1.65337915e+03 -2.86632346e+05 3.90e+04 1.78e-15 5.97e+01 0s 3 1.25800830e+03 -1.05536021e+05 1.50e+04 1.17e-15 2.16e+01 0s 4 1.05392734e+03 -4.18783029e+04 3.08e+03 7.55e-15 6.59e+00 0s 5 1.00320672e+03 -1.87655329e+04 2.99e+02 4.44e-15 2.32e+00 0s 6 9.95303528e+02 -3.57250606e+03 7.39e-11 2.66e-15 5.02e-01 0s 7 7.38423131e+02 -2.71802916e+03 4.78e-11 2.46e-15 3.79e-01 0s 8 6.53656813e+02 -2.42962888e+03 4.10e-11 2.39e-15 3.38e-01 0s 9 6.47923181e+02 -1.97272014e+03 4.04e-11 2.17e-15 2.88e-01 0s 10 3.99217913e+02 -1.17800604e+03 2.18e-11 1.61e-15 1.73e-01 0s 11 3.68677831e+02 -1.08641295e+03 1.43e-11 1.80e-15 1.60e-01 0s 12 2.00266426e+02 -5.33969619e+02 7.20e-12 1.35e-15 8.06e-02 0s 13 1.19123525e+02 -1.41847739e+02 2.89e-12 1.16e-15 2.86e-02 0s 14 1.08222356e+02 -1.02465519e+02 4.00e-12 1.45e-15 2.31e-02 0s 15 9.47100844e+01 -6.37870398e+01 2.83e-12 1.52e-15 1.74e-02 0s 16 8.23167371e+01 -2.89615285e+01 2.26e-11 1.76e-15 1.22e-02 0s 17 7.72506227e+01 1.36139726e+01 1.35e-11 1.55e-15 6.98e-03 0s 18 6.99203179e+01 4.62006456e+01 1.34e-11 1.24e-15 2.60e-03 0s 19 6.74550545e+01 5.64561731e+01 3.71e-10 1.17e-15 1.21e-03 0s 20 6.70617959e+01 6.04625274e+01 3.38e-10 1.26e-15 7.24e-04 0s 21 6.59238149e+01 6.17781918e+01 1.45e-10 1.40e-15 4.55e-04 0s 22 6.56407218e+01 6.35541613e+01 9.15e-11 1.20e-15 2.29e-04 0s 23 6.52632228e+01 6.45839783e+01 3.27e-11 1.11e-15 7.46e-05 0s 24 6.50984654e+01 6.49457386e+01 4.55e-11 1.00e-15 1.68e-05 0s 25 6.50739881e+01 6.50608917e+01 3.72e-11 8.75e-16 1.44e-06 0s 26 6.50710067e+01 6.50709794e+01 1.25e-11 9.75e-16 2.99e-09 0s 27 6.50710000e+01 6.50710000e+01 1.63e-11 1.24e-15 2.99e-12 0s Barrier solved model in 27 iterations and 0.24 seconds Optimal objective 6.50710000e+01 Root relaxation: objective 6.507100e+01, 1459 iterations, 0.27 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 65.07100 0 60 1000.00000 65.07100 93.5% - 0s H 0 0 66.0000000 65.07100 1.41% - 0s Explored 0 nodes (3790 simplex iterations) in 0.70 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 6.600000000000e+01, best bound 6.600000000000e+01, gap 0.0% Preprocessing time: 0.19 seconds Gurobi run time: 0.70 seconds Total run time: 0.89 seconds Objective: 66 Solution: 2 x [2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 6, 6, 8] 1 x [2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 6, 6, 8] 17 x [1, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6] 10 x [2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6, 6] 1 x [2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 6, 6] 1 x [1, 1, 1, 2, 2, 6, 6] 6 x [2, 2, 2, 2, 2, 2, 6, 6, 9, 9, 9, 9, 9, 9] 4 x [2, 2, 2, 2, 2, 4, 6, 6, 6, 9, 9, 9] 1 x [1, 6, 6, 6, 6, 6, 6] 1 x [1, 6, 6, 6, 6, 6, 6, 9, 9, 9, 9] 1 x [1, 6, 6, 6, 6, 6, 6, 9, 9, 9, 9, 9, 9, 9] 16 x [1, 1, 1, 3, 3, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9] 5 x [3, 3, 3, 3, 4, 4, 4, 8, 8, 8, 8, 8, 8, 9, 9, 9]