Build (method = -2) #dp: 271 Step-3' Graph: 53 vertices and 152 arcs (0.00s) Step-4' Graph: 32 vertices and 110 arcs (0.00s) #V4/#V3 = 0.60 #A4/#A3 = 0.72 Ready! (0.00s) Optimize a model with 52 rows, 111 columns and 273 nonzeros Presolve removed 13 rows and 14 columns Presolve time: 0.00s Presolved: 39 rows, 97 columns, 238 nonzeros Variable types: 0 continuous, 97 integer (4 binary) Found heuristic solution: objective 50.0000000 Optimize a model with 39 rows, 97 columns and 238 nonzeros Presolved: 39 rows, 97 columns, 238 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.490e+02 Factor NZ : 4.500e+02 Factor Ops : 6.060e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.42780492e+02 -8.82100900e+02 6.69e+02 1.76e-01 1.77e+01 0s 1 1.10252207e+02 -2.20559798e+02 1.28e+02 5.55e-16 3.21e+00 0s 2 6.11415295e+01 -3.89596672e+01 4.52e+00 4.44e-16 5.27e-01 0s 3 5.12272576e+01 3.18301195e+01 5.20e-01 3.61e-16 9.65e-02 0s 4 4.58608936e+01 3.84369055e+01 2.73e-02 2.22e-16 3.66e-02 0s 5 4.40923761e+01 4.24247265e+01 5.33e-03 1.49e-16 8.22e-03 0s 6 4.35489351e+01 4.33193803e+01 9.65e-04 2.26e-16 1.13e-03 0s 7 4.35197833e+01 4.34748147e+01 2.72e-04 3.33e-16 2.22e-04 0s 8 4.35001432e+01 4.34998148e+01 1.09e-06 1.96e-16 1.62e-06 0s 9 4.35000000e+01 4.35000000e+01 4.72e-12 2.22e-16 2.64e-12 0s Barrier solved model in 9 iterations and 0.00 seconds Optimal objective 4.35000000e+01 Root relaxation: objective 4.350000e+01, 46 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 43.50000 0 12 50.00000 43.50000 13.0% - 0s H 0 0 45.0000000 43.50000 3.33% - 0s H 0 0 44.0000000 43.50000 1.14% - 0s Explored 0 nodes (66 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 4.400000000000e+01, best bound 4.400000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.02 seconds Objective: 44 Solution: 2 x [3] 2 x [12, 13] 1 x [7, 14] 4 x [8, 14] 7 x [13, 18] 8 x [7, 20] 2 x [1, 5] 2 x [5, 16] 2 x [2, 11] 3 x [2, 15] 1 x [2, 19] 2 x [2, 6] 2 x [4, 6, 9] 1 x [6, 9, 10] 4 x [6, 15, 17] 1 x [4, 6, 8]