Build (method = -2) #dp: 226 Step-3' Graph: 44 vertices and 156 arcs (0.00s) Step-4' Graph: 31 vertices and 130 arcs (0.00s) #V4/#V3 = 0.70 #A4/#A3 = 0.83 Ready! (0.00s) Optimize a model with 41 rows, 131 columns and 337 nonzeros Presolve removed 6 rows and 11 columns Presolve time: 0.00s Presolved: 35 rows, 120 columns, 315 nonzeros Variable types: 0 continuous, 120 integer (0 binary) Found heuristic solution: objective 74.0000000 Optimize a model with 35 rows, 120 columns and 315 nonzeros Presolved: 35 rows, 120 columns, 315 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.760e+02 Factor NZ : 3.960e+02 Factor Ops : 5.406e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 3.34299846e+02 -1.55792554e+03 7.67e+02 2.22e-16 2.93e+01 0s 1 1.36546746e+02 -7.11925304e+02 9.00e+01 4.44e-16 5.42e+00 0s 2 7.99455540e+01 -7.67833426e+01 9.94e-01 7.77e-15 6.43e-01 0s 3 5.65103741e+01 -3.08500197e+00 1.47e-02 2.66e-15 2.41e-01 0s 4 4.82190837e+01 2.13160052e+01 3.65e-03 1.33e-15 1.09e-01 0s 5 4.34076452e+01 3.51962017e+01 7.33e-04 2.22e-16 3.31e-02 0s 6 4.21015782e+01 3.73428279e+01 2.54e-04 2.22e-16 1.92e-02 0s 7 4.16268187e+01 4.07178582e+01 8.99e-05 3.33e-16 3.67e-03 0s 8 4.14294230e+01 4.11738198e+01 1.68e-05 1.11e-16 1.03e-03 0s 9 4.13687190e+01 4.13243484e+01 1.63e-06 3.33e-16 1.79e-04 0s 10 4.13572658e+01 4.13564980e+01 1.31e-13 2.09e-16 3.10e-06 0s 11 4.13571429e+01 4.13571429e+01 5.68e-14 3.33e-16 8.93e-12 0s Barrier solved model in 11 iterations and 0.00 seconds Optimal objective 4.13571429e+01 Root relaxation: objective 4.135714e+01, 26 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 41.35714 0 10 74.00000 41.35714 44.1% - 0s H 0 0 42.0000000 41.35714 1.53% - 0s Explored 0 nodes (45 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.200000000000e+01, best bound 4.200000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 42 Solution: 2 x [5, 6] 13 x [3, 5] 3 x [2, 4] 1 x [3, 4, 6] 1 x [3, 3, 4, 6] 2 x [2, 9, 10] 8 x [10, 10] 1 x [2, 9] 4 x [2, 2, 3] 3 x [1, 7, 8] 4 x [1, 7, 7]