Build (method = -2) #dp: 148 Step-3' Graph: 29 vertices and 78 arcs (0.00s) Step-4' Graph: 5 vertices and 30 arcs (0.00s) #V4/#V3 = 0.17 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 14 rows, 31 columns and 89 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 12 rows, 29 columns, 85 nonzeros Variable types: 0 continuous, 29 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 89.0000000 Optimize a model with 12 rows, 29 columns and 85 nonzeros Presolved: 12 rows, 29 columns, 85 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.000e+01 Factor NZ : 7.800e+01 Factor Ops : 6.500e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 1.70640354e+02 -2.60773042e+02 1.90e+01 1.11e-16 1.22e+01 0s 1 6.08341622e+01 -6.18096351e+01 7.11e-15 2.22e-16 1.88e+00 0s 2 3.54233507e+01 2.39825114e+01 1.33e-14 2.22e-16 1.71e-01 0s 3 3.33422597e+01 3.33010677e+01 2.15e-14 2.22e-16 6.15e-04 0s 4 3.33333423e+01 3.33333011e+01 4.68e-15 1.11e-16 6.15e-07 0s 5 3.33333333e+01 3.33333333e+01 2.32e-14 3.33e-16 6.15e-13 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 23 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 4 89.00000 33.33333 62.5% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (26 simplex iterations) in 0.00 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.01 seconds Gurobi run time: 0.00 seconds Total run time: 0.01 seconds Objective: 34 Solution: 11 x [1, 4, 5] 6 x [2, 5, 8] 8 x [3, 6, 7] 1 x [7, 9] 5 x [1, 2, 9] 2 x [2, 6, 8] 1 x [2, 6]