Build (method = -2) #dp: 160 Step-3' Graph: 32 vertices and 87 arcs (0.00s) Step-4' Graph: 5 vertices and 33 arcs (0.00s) #V4/#V3 = 0.16 #A4/#A3 = 0.38 Ready! (0.00s) Optimize a model with 15 rows, 34 columns and 98 nonzeros Presolve removed 2 rows and 2 columns Presolve time: 0.00s Presolved: 13 rows, 32 columns, 94 nonzeros Variable types: 0 continuous, 32 integer (3 binary) Found heuristic solution: objective 98.0000000 Found heuristic solution: objective 94.0000000 Optimize a model with 13 rows, 32 columns and 94 nonzeros Presolved: 13 rows, 32 columns, 94 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 3.300e+01 Factor NZ : 9.100e+01 Factor Ops : 8.190e+02 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.99330202e+02 -2.64333794e+02 6.41e+01 3.68e-02 1.98e+01 0s 1 7.02468581e+01 -1.14449517e+02 6.04e-01 2.22e-16 2.67e+00 0s 2 4.37115464e+01 1.05778019e+01 1.69e-03 2.22e-16 4.57e-01 0s 3 3.34148758e+01 3.17451701e+01 1.51e-14 1.11e-16 2.29e-02 0s 4 3.33335410e+01 3.33317478e+01 1.04e-14 2.22e-16 2.46e-05 0s 5 3.33333333e+01 3.33333333e+01 6.31e-15 1.11e-16 2.46e-11 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 26 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 94.00000 33.33333 64.5% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (37 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: 4 x [1, 6, 8] 1 x [8, 9] 7 x [3, 5, 5] 5 x [1, 3, 9] 2 x [4, 4, 10] 11 x [6, 7, 10] 2 x [1, 5, 10] 1 x [1, 2, 4] 1 x [1, 6]