Build (method = -2) #dp: 123 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 (6 binary) Found heuristic solution: objective 97.0000000 Found heuristic solution: objective 85.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 2.83753982e+02 -2.61747279e+02 6.61e+01 3.68e-02 1.98e+01 0s 1 6.64692677e+01 -1.07041354e+02 5.00e-01 3.89e-16 2.78e+00 0s 2 4.06283035e+01 2.17775875e+01 7.99e-15 1.67e-16 2.91e-01 0s 3 3.33754280e+01 3.31140671e+01 7.12e-15 2.22e-16 4.02e-03 0s 4 3.33333756e+01 3.33331142e+01 2.52e-14 2.22e-16 4.02e-06 0s 5 3.33333333e+01 3.33333333e+01 7.04e-15 2.22e-16 4.02e-12 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 3 85.00000 33.33333 60.8% - 0s H 0 0 34.0000000 33.33333 1.96% - 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 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: 1 x [1, 6, 9] 12 x [3, 8, 9] 1 x [2, 4, 8] 10 x [1, 4, 7] 2 x [3, 5, 8] 1 x [1, 5, 5] 6 x [5, 5, 7] 1 x [7]