Build (method = -2) #dp: 187 Step-3' Graph: 33 vertices and 90 arcs (0.00s) Step-4' Graph: 6 vertices and 36 arcs (0.00s) #V4/#V3 = 0.18 #A4/#A3 = 0.40 Ready! (0.00s) Optimize a model with 16 rows, 37 columns and 105 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 14 rows, 35 columns, 101 nonzeros Variable types: 0 continuous, 35 integer (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 96.0000000 Optimize a model with 14 rows, 35 columns and 101 nonzeros Presolved: 14 rows, 35 columns, 101 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.700e+01 Factor NZ : 1.050e+02 Factor Ops : 1.015e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.00446440e+02 -2.57754531e+02 3.48e+01 2.22e-16 1.26e+01 0s 1 6.23207153e+01 -7.59210473e+01 2.84e-14 2.22e-16 1.78e+00 0s 2 3.94513042e+01 4.42958270e+00 1.33e-14 2.22e-16 4.41e-01 0s 3 3.34026787e+01 3.17170144e+01 1.51e-14 9.71e-17 2.11e-02 0s 4 3.33354474e+01 3.33301054e+01 2.57e-15 2.22e-16 6.68e-05 0s 5 3.33333333e+01 3.33333333e+01 1.03e-14 2.22e-16 1.04e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 28 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 3 96.00000 33.33333 65.3% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (30 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: 3 x [2, 3, 4] 1 x [4, 5, 6] 11 x [6, 9, 10] 8 x [1, 3, 5] 2 x [2, 2, 9] 6 x [2, 6, 8] 1 x [7] 1 x [2, 6, 7] 1 x [2, 2, 6]