Build (method = -2) #dp: 88 Step-3' Graph: 18 vertices and 47 arcs (0.00s) Step-4' Graph: 16 vertices and 43 arcs (0.00s) #V4/#V3 = 0.89 #A4/#A3 = 0.91 Ready! (0.00s) Optimize a model with 25 rows, 44 columns and 104 nonzeros Presolve removed 14 rows and 22 columns Presolve time: 0.00s Presolved: 11 rows, 22 columns, 62 nonzeros Variable types: 0 continuous, 22 integer (0 binary) Optimize a model with 11 rows, 22 columns and 62 nonzeros Presolved: 11 rows, 22 columns, 62 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.600e+01 Factor NZ : 6.600e+01 Factor Ops : 5.060e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 5.64798645e+01 -1.98185257e+01 5.03e+01 0.00e+00 1.03e+01 0s 1 3.53198134e+01 -2.34769019e+00 4.86e+00 3.89e-16 1.48e+00 0s 2 3.04351868e+01 2.46178631e+01 8.47e-01 7.77e-16 1.96e-01 0s 3 3.00066191e+01 2.97735662e+01 8.53e-14 4.58e-16 6.13e-03 0s 4 3.00000066e+01 2.99997735e+01 1.42e-14 6.85e-16 6.13e-06 0s 5 3.00000000e+01 3.00000000e+01 2.84e-13 1.05e-15 6.13e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 3.00000000e+01 Root relaxation: objective 3.000000e+01, 15 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 30.0000000 30.00000 0.0% - 0s Explored 0 nodes (15 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.000000000000e+01, best bound 3.000000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 30 Solution: 3 x [1, 2, 3, 5] 2 x [1, 2, 5] 12 x [1, 5, 6, 7] 8 x [3, 5] 3 x [4, 5, 7, 8] 2 x [4, 5, 9]