Build (method = -2) #dp: 13124 Step-3' Graph: 126 vertices and 366 arcs (0.07s) Step-4' Graph: 21 vertices and 156 arcs (0.07s) #V4/#V3 = 0.17 #A4/#A3 = 0.43 Ready! (0.07s) Optimize a model with 40 rows, 157 columns and 438 nonzeros Presolve removed 9 rows and 16 columns Presolve time: 0.00s Presolved: 31 rows, 141 columns, 409 nonzeros Variable types: 0 continuous, 141 integer (6 binary) Found heuristic solution: objective 198.0000000 Found heuristic solution: objective 145.0000000 Optimize a model with 31 rows, 141 columns and 409 nonzeros Presolved: 31 rows, 141 columns, 409 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.570e+02 Factor NZ : 4.500e+02 Factor Ops : 8.668e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.20370984e+03 -1.55721150e+03 4.04e+02 5.70e-02 4.59e+01 0s 1 2.53874379e+02 -8.62714672e+02 3.28e+01 4.44e-16 6.28e+00 0s 2 1.01727589e+02 -1.42308739e+02 1.31e-13 5.55e-16 8.19e-01 0s 3 4.06050763e+01 8.64110058e+00 4.65e-14 3.33e-16 1.07e-01 0s 4 3.45318516e+01 3.15140984e+01 1.05e-14 2.22e-16 1.01e-02 0s 5 3.33489238e+01 3.32922956e+01 5.33e-14 3.33e-16 1.89e-04 0s 6 3.33333342e+01 3.33333305e+01 1.43e-14 2.22e-16 1.23e-08 0s 7 3.33333333e+01 3.33333333e+01 1.47e-14 1.89e-16 1.27e-14 0s Barrier solved model in 7 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 121 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 33.33333 0 7 145.00000 33.33333 77.0% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (141 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.400000000000e+01, best bound 3.400000000000e+01, gap 0.0% Preprocessing time: 0.07 seconds Gurobi run time: 0.01 seconds Total run time: 0.08 seconds Objective: 34 Solution: 14 x [1, 7, 9, 10, 14, 19] 1 x [2, 3, 10, 12, 13, 19] 1 x [3, 9, 12, 13, 16, 19] 2 x [3, 5, 8, 16, 18, 19] 8 x [6, 8, 11, 12, 17, 18] 1 x [4, 13, 17, 19] 2 x [3, 6, 15, 15, 17, 19] 3 x [1, 3, 4, 13, 16, 18] 1 x [3, 4, 13, 16, 18] 1 x [3, 12, 13, 16, 19]