Build (method = -2) #dp: 148 Step-3' Graph: 31 vertices and 86 arcs (0.00s) Step-4' Graph: 25 vertices and 74 arcs (0.00s) #V4/#V3 = 0.81 #A4/#A3 = 0.86 Ready! (0.00s) Optimize a model with 35 rows, 75 columns and 179 nonzeros Presolve removed 13 rows and 23 columns Presolve time: 0.00s Presolved: 22 rows, 52 columns, 146 nonzeros Variable types: 0 continuous, 52 integer (7 binary) Found heuristic solution: objective 26.0000000 Found heuristic solution: objective 25.0000000 Optimize a model with 22 rows, 52 columns and 146 nonzeros Presolve removed 4 rows and 9 columns Presolved: 18 rows, 43 columns, 125 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 9.100e+01 Factor NZ : 1.710e+02 Factor Ops : 2.109e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.40000000e+01 -8.40000000e+00 1.77e+02 0.00e+00 1.32e+00 0s 1 2.40000000e+01 1.26310140e+01 2.27e+01 5.55e-17 2.12e-01 0s 2 2.40000000e+01 2.21086593e+01 2.22e+00 4.86e-17 2.58e-02 0s 3 2.40000000e+01 2.38576652e+01 1.34e-01 5.38e-17 1.67e-03 0s 4 2.40000000e+01 2.39997704e+01 2.69e-04 2.22e-17 2.68e-06 0s 5 2.40000000e+01 2.40000000e+01 2.83e-10 3.41e-17 2.71e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 2.40000000e+01 Root relaxation: objective 2.400000e+01, 27 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time * 0 0 0 24.0000000 24.00000 0.0% - 0s Explored 0 nodes (27 simplex iterations) in 0.00 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 2.400000000000e+01, best bound 2.400000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 24 Solution: 2 x [1, 2, 5] 2 x [1, 3, 4, 5] 1 x [1, 3, 4, 5, 7] 13 x [1, 3, 5, 7] 3 x [1, 3, 5, 8, 9] 2 x [1, 3, 5, 8, 10] 1 x [1, 5, 6, 8]