Build (method = -2) #dp: 151 Step-3' Graph: 37 vertices and 104 arcs (0.00s) Step-4' Graph: 25 vertices and 80 arcs (0.00s) #V4/#V3 = 0.68 #A4/#A3 = 0.77 Ready! (0.00s) Optimize a model with 35 rows, 81 columns and 197 nonzeros Presolve removed 6 rows and 10 columns Presolve time: 0.00s Presolved: 29 rows, 71 columns, 176 nonzeros Variable types: 0 continuous, 71 integer (0 binary) Found heuristic solution: objective 65.0000000 Found heuristic solution: objective 51.0000000 Optimize a model with 29 rows, 71 columns and 176 nonzeros Presolved: 29 rows, 71 columns, 176 nonzeros Root barrier log... Ordering time: 0.00s Barrier statistics: AA' NZ : 1.200e+02 Factor NZ : 3.630e+02 Factor Ops : 5.531e+03 (less than 1 second per iteration) Threads : 1 Objective Residual Iter Primal Dual Primal Dual Compl Time 0 2.16267004e+02 -8.45340654e+02 6.00e+02 0.00e+00 2.46e+01 0s 1 9.78833058e+01 -2.67590389e+02 8.63e+01 3.89e-16 4.21e+00 0s 2 5.51603590e+01 -4.54055395e+01 8.44e-01 4.44e-16 6.84e-01 0s 3 4.03922584e+01 8.21703160e+00 7.49e-03 2.08e-16 2.16e-01 0s 4 3.45804207e+01 2.45111195e+01 9.89e-04 1.94e-16 6.76e-02 0s 5 3.26666479e+01 2.85350205e+01 1.93e-04 1.41e-16 2.77e-02 0s 6 3.20741586e+01 3.12029243e+01 6.13e-05 1.77e-16 5.85e-03 0s 7 3.20319751e+01 3.19814435e+01 4.54e-06 2.22e-16 3.39e-04 0s 8 3.20000322e+01 3.19999752e+01 1.32e-13 2.14e-16 3.83e-07 0s 9 3.20000000e+01 3.20000000e+01 9.41e-14 1.82e-16 4.30e-13 0s Barrier solved model in 9 iterations and 0.00 seconds Optimal objective 3.20000000e+01 Root relaxation: objective 3.200000e+01, 42 iterations, 0.00 seconds Nodes | Current Node | Objective Bounds | Work Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time 0 0 32.00000 0 9 51.00000 32.00000 37.3% - 0s H 0 0 34.0000000 32.00000 5.88% - 0s H 0 0 33.0000000 32.00000 3.03% - 0s H 0 0 32.0000000 32.00000 0.0% - 0s Explored 0 nodes (61 simplex iterations) in 0.01 seconds Thread count was 1 (of 8 available processors) Optimal solution found (tolerance 0.00e+00) Best objective 3.200000000000e+01, best bound 3.200000000000e+01, gap 0.0% Preprocessing time: 0.01 seconds Gurobi run time: 0.01 seconds Total run time: 0.01 seconds Objective: 32 Solution: 1 x [1, 4] 9 x [1, 5, 9] 1 x [1, 6] 2 x [1, 6, 7] 1 x [1, 10] 4 x [2, 3, 9] 6 x [2, 4, 5] 7 x [2, 4, 7, 8] 1 x [2, 4, 9]