Build (method = -2) #dp: 188 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 (0 binary) Found heuristic solution: objective 99.0000000 Found heuristic solution: objective 96.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 1.84920107e+02 -2.63561383e+02 1.99e+01 0.00e+00 1.21e+01 0s 1 6.17217545e+01 -7.17464971e+01 2.84e-14 2.22e-16 1.85e+00 0s 2 3.84499803e+01 2.25955397e+01 4.44e-15 1.25e-16 2.15e-01 0s 3 3.33654867e+01 3.31303685e+01 1.73e-14 4.44e-16 3.18e-03 0s 4 3.33333659e+01 3.33331307e+01 2.13e-14 6.51e-18 3.18e-06 0s 5 3.33333333e+01 3.33333333e+01 1.51e-14 2.22e-16 3.18e-12 0s Barrier solved model in 5 iterations and 0.00 seconds Optimal objective 3.33333333e+01 Root relaxation: objective 3.333333e+01, 25 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 96.00000 33.33333 65.3% - 0s H 0 0 34.0000000 33.33333 1.96% - 0s Explored 0 nodes (39 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 [3, 5, 7] 3 x [1, 6, 7] 9 x [2, 3, 5] 2 x [1, 3, 6] 7 x [8, 9, 10] 1 x [6, 6, 8] 1 x [2] 10 x [1, 4, 10]