Build (method = -2) #dp: 145 Step-3' Graph: 28 vertices and 76 arcs (0.00s) Step-4' Graph: 5 vertices and 30 arcs (0.00s) #V4/#V3 = 0.18 #A4/#A3 = 0.39 Ready! (0.00s) Optimize a model with 14 rows, 31 columns and 88 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 12 rows, 29 columns, 84 nonzeros Variable types: 0 continuous, 29 integer (0 binary) Found heuristic solution: objective 66.0000000 Optimize a model with 12 rows, 29 columns and 84 nonzeros Presolved: 12 rows, 29 columns, 84 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 2.28045396e+02 -3.22908767e+02 2.46e+01 1.11e-16 1.57e+01 0s 1 7.82033279e+01 -8.45052334e+01 3.02e-01 3.33e-16 2.54e+00 0s 2 4.35025575e+01 -1.67756815e+00 2.99e-02 2.22e-16 6.81e-01 0s 3 3.36094820e+01 3.11590380e+01 4.88e-15 3.33e-16 3.66e-02 0s 4 3.33362257e+01 3.33092163e+01 1.09e-14 2.22e-16 4.03e-04 0s 5 3.33333333e+01 3.33333333e+01 1.48e-14 1.11e-16 7.94e-10 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 22 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 66.00000 33.33333 49.5% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (23 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, 5, 9] 1 x [3, 9] 1 x [3, 7, 9] 13 x [4, 6, 8] 1 x [3, 5, 7] 1 x [3, 7, 7] 5 x [6, 7, 7] 1 x [2, 2]